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
3 citations
TL;DR: It is shown that a language of infinite binary trees is definable by a Σ 2 -formula of the monadic second order logic of two successors (with no additional symbols) iff it can be accepted by a Buchi automaton.
3 citations
25 May 2015
TL;DR: Examination of automata with asymmetric starting conditions shows that the highest fitness individuals are those that follow a growth pattern that restores symmetry, which strongly suggests that optimizing the size of an apoptotic automata that has a symmetric pattern of states is a substantially easier problem.
Abstract: An apoptotic cellular automata consists of an initial state and an updating rule. These specify an automata that grows for a time and then enters a quiescent state. This study generalizes earlier work on evolving 1D apoptotic automata to evolving 2D automata, producing a type of evolved art. Parameter studies are performed and it is found that the most important factors are algorithm runtime and the symmetry of the initial conditions of the automata. Other parameters such as mutation rate and tournament size are found to be relatively soft, as long as they do not take on extreme values. A collection of examples of renderings of evolved cellular automata are provided and steps for additional work to improve the system are outlined. Examination of automata with asymmetric starting conditions shows that the highest fitness individuals are those that follow a growth pattern that restores symmetry. This strongly suggests that optimizing the size of an apoptotic automata that has a symmetric pattern of states is a substantially easier problem.
3 citations
TL;DR: The practicality of the idea of using finite automata to implement new constraints for local search is established, and it is shown that it is competitive with the approach of [Pralong, 2007].
Abstract: We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].
3 citations
21 Sep 2004
TL;DR: This work describes the language related to a full transitive subshift extending the notion of irreducibility and shows how to associate to any subshift of finite type a cellular automaton which contains it.
Abstract: We study the subshift behavior of one dimensional cellular automata and we show how to associate to any subshift of finite type a cellular automaton which contains it. The relationships between some topological properties of subshifts and the behavior of the related languages are investigated. In particular we focus our attention to the notion of full transitivity. We characterize the language related to a full transitive subshift extending the notion of irreducibility.
3 citations