IMPLEMENTASI DETERMINISTIC FINITE AUTOMATA (DFA) PADA PERANCANGAN APLIKASI PERHITUNGAN UANG HARIAN PERJALANAN DINAS KEMENTERIAN

Each ministry always has a budget for official travel, especially for the daily money given to personnel who travel in exchange for daily expenses. With the current pendemi need to be held an application system that can reduce contact when handling official travel files. The design of this application will use the implementation of Deterministic Finite Automata (DFA) as an abstract machine to determine the state or stages to determine the transition between these stages to determine the daily money calculation of official travel. From the calculation of daily money will be made recapitulation to be verified and if it is considered appropriate and correct will be transferred to the account that travels to the office. This is the role in making abstract machines for the calculation of daily money using Deterministic Finite Automata (DFA) because each stage is right to one stage next until the last stage that prints proof of transfer.

Decoding and deterritorialization. Capitalism and state in the thought of Gilles Deleuze and Félix Guattari

This text aims to present the thoughts of Gilles Deleuze and Félix Guattari in the context of the relationship between the state, capitalism, and machines. Due to the multiplicity and rhizomatics that characterize the works of both French philosophers, the author also outlines the basic concepts important from the point of view of the discussed problem, such as abstract machines, devices, segmentation, deterritorialization, coding, axiomatics, rhizoma, micropolitics, and macropolitics. The perspective proposed in the works of Deleuze and Guattari escapes the well-known patterns of analysis in social sciences, which makes them an interesting look at the relationship between the state and capitalism.

1. Abstract Machines

Johan Fredrikzon spent one and a half years as a visiting research assistant at the Film and Media Studies Program at Yale University 2018/2019. Some months before he arrived, a two-day workshop on Simondon was held by the Yale-Düsseldorf Working Group on Philosophy and Media, titled Modes of Technical Objects, with scholars from the US and Germany. Fredrikzon decided to engage a few of the workshop participants for this special issue of Sensorium, with the purpose to discuss perspectives on Simondon as a theoretical instrument for thinking technology, how the French philosopher matters in their work, and why there seems to be a revival in the interest in the writing of Simondon these days. About Gary Tomlinson: Gary Tomlinson is John Hay Whitney Professor of Music and the Humanities and director of the Whitney Humanities Center at Yale University. Tomlinson has taught and written about the history of opera and early-modern musical thought and practice, but also on the philosophy of history and anthropological theory. In his current research, he combines humanistic theory with evolutionary science and archaeology to search for the role of culture in the evolution of man. Following A Million Years of Music: The Emergence of Human Modernity (MIT Press, 2015), his new book Culture and the Course of Human Evolution (Chicago, 2018) deepens the theoretical framework on how culture has shaped biology.

Posthumanism

Several distinct strains of posthumanist discourse have pointed beyond twentieth-century humanisms, but their project of alienating the human in a transhuman or transspecies commons remains elusive. Human music can aid in this project, if we gauge it against nonhuman communicative means that we habitually describe as “music” or “song.” All these behaviours are semiotic in nature, their human and nonhuman forms at once related and distinct by virtue of the supernormal animal capacities they marshal. To understand their relations requires the operation of deep-historical abstract machines or modes of virtuality that formed them and shaped the distinctive turn marking the late stages of hominin evolution. Evolutionary musical studies can describe the emergence of human music from this semiotic evolution, distancing music from both nonhuman song and human symbolism and language in features such as discrete pitch perception and rhythmic entrainment. Together these efforts build a prehuman scaffold for posthumanist thought.

Triadic Automata and Machines as Information Transformers

Algorithms and abstract automata (abstract machines) are used to describe, model, explore and improve computers, cell phones, computer networks, such as the Internet, and processes in them. Traditional models of information processing systems—abstract automata—are aimed at performing transformations of data. These transformations are performed by their hardware (abstract devices) and controlled by their software (programs)—both of which stay unchanged during the whole computational process. However, in physical computers, their software is also changing by special tools such as interpreters, compilers, optimizers and translators. In addition, people change the hardware of their computers by extending the external memory. Moreover, the hardware of computer networks is incessantly altering—new computers and other devices are added while other computers and other devices are disconnected. To better represent these peculiarities of computers and computer networks, we introduce and study a more complete model of computations, which is called a triadic automaton or machine. In contrast to traditional models of computations, triadic automata (machine) perform computational processes transforming not only data but also hardware and programs, which control data transformation. In addition, we further develop taxonomy of classes of automata and machines as well as of individual automata and machines according to information they produce.

Semantic Foundations for Deterministic Dataflow and Stream Processing

We propose a denotational semantic framework for deterministic dataflow and stream processing that encompasses a variety of existing streaming models. Our proposal is based on the idea that data streams, stream transformations, and stream-processing programs should be classified using types. The type of a data stream is captured formally by a monoid, an algebraic structure with a distinguished binary operation and a unit. The elements of a monoid model the finite fragments of a stream, the binary operation represents the concatenation of stream fragments, and the unit is the empty fragment. Stream transformations are modeled using monotone functions on streams, which we call stream transductions. These functions can be implemented using abstract machines with a potentially infinite state space, which we call stream transducers. This abstract typed framework of stream transductions and transducers can be used to (1) verify the correctness of streaming computations, that is, that an implementation adheres to the desired behavior, (2) prove the soundness of optimizing transformations, e.g. for parallelization and distribution, and (3) inform the design of programming models and query languages for stream processing. In particular, we show that several useful combinators can be supported by the full class of stream transductions and transducers: serial composition, parallel composition, and feedback composition.

Penerapan Konsep Finite State Automata (FSA) pada Aplikasi Simulasi Vending Machine Yoghurt Walagri

Language theory and automata is a theory that related to abstract machines which in there is Finite State Automata. FSA can be implemented in design of a vending machine. Vending machines in Indonesia operate mostly with products such as canned drinks, plastic bottles, coffee, snacks, and tickets. This research discuss about simulating application design of Walagri Yoghurt vending machine, a yoghurt produced by Biotechnology Departement at the University of Muhammadiyah Bandung, based on the implementation of Finite State Automata. The conclusion obtained in this study is that Finite State Automata can be used as a basic logic for making vending machine simulations.