Topic
ω-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.
Papers published on a yearly basis
Papers
More filters
TL;DR: All cellular automata simulating an AND gate may have similar values for these parameters that could lead to answer the question Where are the edges of computational universality?
Abstract: The emergence of computation in complex systems "with simple components is a hot topic in the science of complexity. A uniform framework to study emergent computation in complex systems are cellular automata. They are discrete systems in which an array of cells evolves from generation to generation on the basis of local transition rules. The well-established problem of emergent computation and universality in cellular automata has been tackled by a number of people in the last thirty years and remains an area "where amazing phenomena at the edge of theoretical computer science and nonlinear science can be discovered. Future work could also evaluate all discovered cellular automata and calculate for each cellular automaton some rule-based parameters, e.g., Langtons lamda. All cellular automata simulating an AND gate may have similar values for these parameters that could lead to answer the question Where are the edges of computational universality? and may therefore lead to a better understanding of the emergence of computation in complex systems with local interactions.
23 citations
24 Jul 2000
TL;DR: Results of experiments carried out on automata representing German, and Dutch morphological dictionaries are presented, showing the impact on the size of automata and compression methods used here.
Abstract: Several compression methods of finite-state automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on automata representing German, and Dutch morphological dictionaries.
23 citations
TL;DR: The concept of a continuous-time probabilistic automaton, which can change in each moment of the considered time interval, and the events accepted, the conditions of connectivity, as well as their discrete approximations are discussed are presented.
Abstract: The concept of a continuous-time probabilistic automaton is presented in the paper. The probability distribution over the state space of this kind of automaton can change in each moment of the considered time interval. In this case, such notions as input word, event, regular event undergo respective modifications. It is also useful to consider the infinitesimal-state diagram instead of the ordinary one. For the automata thus defined, the events accepted, the conditions of connectivity, as well as their discrete approximations are discussed. To conclude, examples of systems are given that belong to the axiomatic framework of continuous-time probabilistic automata.
23 citations
26 Sep 2007
TL;DR: It is shown that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection.
Abstract: We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata.
22 citations
01 Sep 1998
TL;DR: Applying the finite automata in various tasks of the formal languages theory is observed and new problems of the theory of the infinite automata are considered.
Abstract: Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene’s theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The properties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expressions for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.
22 citations