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
Journal Article•
TL;DR: In this paper, the automata-theoretical background of Iliopoulos's ALL-BORDERS algorithm is discussed and an automata based algorithm that finds approximate borders with Hamming distance is presented.
Abstract: A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper discusses automata-theoretical background of Iliopoulos's ALL-BORDERS algorithm that finds all borders of a string with don't care symbols. We show that ALL-BORDERS algorithm is a simulator of a finite automaton together with explaining the function of the automaton. We show that the simulated automaton accepts intersection of sets of prefixes and suffixes (and thus a set of borders) of the input string. Last but not least we define approximate borders. Based on the knowledge of the automata background of ALL_BORDERS algorithm we offer an automata-based algorithm that finds approximate borders with Hamming distance. We discuss conditions under which the same principle can be used for other distance measures for which an approximate searching automaton can be constructed.
25 Apr 2009
TL;DR: A parallel algorithm for translating regular expression into its Follow automata is proposed in the paper and the parallel processing of algorithm is described in detail with an example.
Abstract: A parallel algorithm for translating regular expression into its Follow automata is proposed in the paper. Firstly, we construct the Thompson automata of a regular expression. Then, the Glushkov automata are achieved by removing the path and the equivalent states which have equivalent relations are merged into one. So we can get a smaller finite automata, named Follow automata. Finally the parallel processing of algorithm is described in detail with an example.
Posted Content•
TL;DR: It is discovered that populations of growing filaments may have useful features that the individual filament does not have and the minimum requirements are, in terms of numbers of states and the range of communication between automata, to observe this for individual filaments.
Abstract: Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising cooperative behaviour these can induce in terms of waves of cellular state changes along a filament of cells. We discover what the minimum requirements are, in terms of numbers of states and the range of communication between automata, to observe this for individual filaments. We also discover that populations of growing filaments may have useful features that the individual filament does not have, and we give the results of numerical simulations.
TL;DR: The problem of realizing finite automata such that linear modules may be used in various configurations is completely solved and a canonical realization is given which makes possible linearity explicit.
01 Jan 2008
TL;DR: It is shown that in general the family of fuzzy languages accepted by (nondeterministic) lattice-valued finite automata (abbreviated as LA) is not closed under complement operation.
Abstract: In this study, we introduce the concept of lattice-valued regular expressions. Such expressions become not only the necessary tool for the analysis and synthesis of fuzzy automata, but give rise to a recursive generation of the family of fuzzy languages accepted by fuzzy automata from certain simple fuzzy languages. We show that the family of fuzzy languages accepted by deterministic lattice-valued finite automata (abbreviated as DLA) is not closed under Kleene closure operation. Similarly, we show that in general the family of fuzzy languages accepted by (nondeterministic) lattice-valued finite automata (abbreviated as LA) is not closed under complement operation. These two findings form an essential difference between lattice-valued finite automata and classic finite automata.