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: Efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton are studied, and a number of techniques of reducing the size of these automata are proposed.
Abstract: Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. This paper studies efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton, and also proposes a number of techniques of reducing the size of these automata.
6 citations
Journal Article•
TL;DR: It is proved that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is infinite and if A is commutative then A is A-finite.
Abstract: In this paper we prove that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is finite. Moreover, if A is commutative then A is A-finite. We prove that if 3 ≤ |A| then a commutative automaton A is simple if and only if it is a cyclic permutation automaton of prime order. We also give some results concerning cyclic, strongly connected and strongly trap-connected automata.
6 citations
TL;DR: It is shown that the two-dimensional languages accepted by deterministic three-way finite automata are closed under complement and under row reflection (rows in reverse order).
6 citations
15 Aug 2006
TL;DR: In this paper, the algebraic properties of reversible finite automata with halting states (RFA) have been considered and a characterization of the boolean closure of the classes of languages recognized by these models has been obtained.
Abstract: Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.
6 citations
TL;DR: A radical generalization of the concept of a plan which is important in problem solving and quite appealing from the automata-theoretic point of view is proposed.
Abstract: The state-space search methods are well-known techniques in problem solving [1]. In general, a sequence of elementary operators is constructed, leading from a given initial state to one of the goal states of a particular problem domain. Let us call any such sequence a plan (it is a plan how to reach the goal). Consider the usual case of a finite state space. The concept of a finite automaton is a natural and obvious abstraction of such a state space. The set of all plans is just the regular language recognized by the corresponding finite automaton -and this seems to be all in which one field can contribute to the other. However, there exists a radical generalization of the concept of a plan ([2], [3]) which is important in problem solving and quite appealing from the automata-theoretic point of view. It is the case of so called \"branching\" or \"conditional\" plans: roughly speaking, a lack of prior information about a particular state makes it necessary to consider two or more outgoing operators in parallel , thus yielding a plan consisting of a set of sequences instead of a single sequence. Moreover, for the same reason, there are no goal states but only \"goal opportunities\", so that a plan may contain also prefixes of its elements. (This approach Is related to the logical framework of [2]; alternatively, one can consider operators with multiple outcomes [3]0
6 citations