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
19 Jul 2011
TL;DR: Another proof of a theorem of Fife is given -- understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words.
Abstract: We give another proof of a theorem of Fife -- understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic.
6 citations
22 Dec 2011
TL;DR: A novel approximated procedure for the problem of reducing the bandwidth of a graph that can balance the quality of results and running times and can lead to good results in a short running time is developed.
Abstract: In this paper we develop a novel approximated procedure for the problem of reducing the bandwidth of a graph. This problem consists of finding a permutation of the rows and columns of a given matrix, which keeps the nonzero elements in a band that is as close as possible to the main diagonal. The new algorithm is based on object migration learning automaton. The algorithm is evaluated on a set of 113 well-known benchmark instances of the literatures and compared with several state-of-the-art algorithms, showing improvements of some previous best results. The positive point of the new proposed algorithm that it can balance the quality of results and running times. So the algorithm can lead to good results in a short running time.
6 citations
TL;DR: In this article, the self-similarity properties of closed relations associated with one-and two-sided cellular automata are studied, and it turns out that these functions are generated by sequential machines, and their graphs are fractal sets generated by hierarchical iterated function systems.
Abstract: The self-similarity properties of the functions (closed relations) associated with one- and two-sided cellular automata are studied. It turns out that these functions are generated by sequential machines, and their graphs are fractal sets generated by hierarchical iterated function systems. The Hausdorff dimensions of the graphs is one for one-sided cellular automata and two for two-sided automata.
6 citations
17 Apr 2007
TL;DR: An algebraic representation for constraint automata is proposed which the product algorithm is based on and input and output of the provided tool are consistent with the other tools supporting Reo join and constraint Automata product.
Abstract: Reo is a language for exogenous coordination of component connectors based on a calculus of channels. Constraint automata has been proposed as Reo formal semantics. The corresponding constraint automata of a Reo circuit is compositionally constructed by the product of all the constituent constraint automata. We introduce a simple alternative algorithm for computing product of two constraint automata in this paper. We also give a greedy algorithm for finding the order of selection of two constraint automata when we have to compute product of more than two constraint automata. The order of our algorithm is less than the other algorithms proposed earlier by a constant factor. We propose an algebraic representation for constraint automata which our product algorithm is based on. Input and output of the provided tool are consistent with the other tools supporting Reo join and constraint automata product.
6 citations
TL;DR: A notion of fuzzy alternating Buchi automata over a distributive lattice L, where a weight is the label of a leaf node of the run tree when executing a transition, is put forward, which is helpful in complementing L -ABAs.
6 citations