ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.

RS -Machines with Almost Blank Tape

Abstract: Finite automata which communicate with counters or with tapes on a single letter alphabet with end mark are studied. A typical machine system s~udied here consists of a family of machines; the finite automaton part of each of the machines is ideutical; each machine has one reset counter (Mmost blank loop tape) and one non-reset counter (ahnost blank straight tape) ; the first counter counts up to a, say, and the second comets up to b. For each pair of natural numbers a, b there is a machine of the system with counters running up to a, b respectively. The system \"accepts\" those pairs (a, b) such that the (a, b)-nmchine eventually halts, when started in standard position. Thus the system de* fines a binary relation on natural numbers. Some solvability and unsolvability results are obtained concerning the emptiness of the set accepted by a system or the emptiness of the intersection of the sets accepted by two or more systems. Some of the theorems strengthen results of Rabin and Scott [8]. It is shown for a certain class of systems that the relations defined by them are exactly the same as those definable in the elementary theory of addition of natural numbers. For another class of systems it is shown that an intersection problem is equivalent to Hilbert's tenth problem.

The Applications of Automata in Game Theory

Abstract: In game theory, presenting players with strategies directly affects the performance of the players. Utilizing the power of automata is one way for presenting players with strategies. In this chapter, the authors studied different types of automata and their applications in game theory. They found that finite automata, adaptive automata, and cellular automata are widely adopted in game theory. The applications of finite automata are found to be limited to present simple strategies. In contrast, adaptive automata and cellular automata are intensively applied in complex environment, where the number of interacted players (human, computer applications, etc.) is high, and therefore, complex strategies are needed. DOI: 10.4018/978-1-4666-4038-2.ch011

A residuated function in a class of Mealy type L-Valued finite automaton

Abstract: A common problem found in literature is the reduction and minimization of automata. In fuzzy finite automata those processes are more complex; it is not always possible to minimize a given fuzzy automaton, M. In this paper we define a notion of order for the set of fuzzy Mealy machines type L-Valued and we prove the existence of a residuated function which works as operator of minimization of fuzzy Mealy machines.

Multi-layer cellular automata for generating normal random numbers

Abstract: In this paper concept of multi-layer cellular automata and a novel neighborhood structure are introduced. According to these concepts, a novel approach for generating normal random numbers is proposed. First layer consists of binary cellular automata which are responsible for activating and inactivating cells in next layers. A cellular automaton with integer values is used for these layers. Interaction between layers of represented cellular automata leads to a dynamic and complex behavior of proposed model. Main idea of this model is based on central limit theorem to generate normal random numbers. To evaluate the quality of proposed model, several simulations are implemented. Results prove that multi-layer cellular automata generate better normal random numbers in comparison to MATLAB.