ω-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.

Reduction factors in finite automata with application to nonlinear filters

Abstract: We examine the reduction factors achieved in finite automata describing several important classes of stack filters It has been shown that finite automata and Markov Chain theory can be used to compute certain statistical properties of stack filters However, if the automaton is not state-minimal, the solution may be intractable, which is the motivation for this work Formulae for the number of states in state-minimal automata are presented

Cellular automata with chaotic rule formation and its characteristics

Abstract: The fractal procedure known as cellular automata are applied to the different field.Cellular Automata are not only of theoretical interest. One of the main topics in CA research is their usage as models of phenomena which can be observed in real life, the practical applications of Cellular Automata can be seen in multiple fields of science and social science. They range from computer science, technology, physics, biology, and math, to economics, psychology, philosophy, and even art. Cellular Automata are discrete dynamical systems, of simple construction but complex and varied behavior.Despite of the simplicity of their construction; Cellular Automata are capable of very complicated behavior with very little specification. The present paper introducesa cellular automata and their applicationwith some rules. It is very useful for future references.

Automata representation for Abelian groups

Abstract: A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. A string is said to be recognized by a finite automaton if the automaton "reads" the string from the left to the right starting from the initial state and finishing at a final state. Another type of automata which is a counterpart of sticker systems, namely Watson-Crick automata, is finite automata which can scan the double-stranded tapes of DNA strings using the complimentary relation. The properties of groups have been extended for the recognition of finite automata over groups. In this paper, two variants of automata, modified deterministic finite automata and modified deterministic Watson-Crick automata are used in the study of Abelian groups. Moreover, the relation between finite automata diagram over Abelian groups and the Cayley table is introduced. In addition, some properties of Abelian groups are presented in terms of automata.