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: It is proved that no nonregular deterministic context-free language is accepted by any systolic Y-tree automaton while some of them, but not all, can be accepted by nondeterministic systolics Y- tree automata.
Abstract: We prove that no nonregular deterministic context-free language is accepted by any systolic Y-tree automaton while some of them, but not all, can be accepted by nondeterministic systolic Y-tree automata. We show that weak superstable systolic automata over incomplete Y-tree can accept only regular languages. We also show that the weak superstability and the superstability problems are decidable for deterministic systolic automata over a sparse and superprefix Y-tree. Moreover we prove that the regularity problem is decidable for systolic binary tree automata.
1 citations
Posted Content•
TL;DR: This work identifies a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter automata that allows the reconstruction of parse trees of the original grammar.
Abstract: We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter automata.
1 citations
15 Dec 2008
TL;DR: A novel proof technique based on Kolmogorov complexity is used to prove that there is an infinite sequence of distinct integers n such that there are languages L n in a 4-letter alphabet such thatthere are quantum finite automata with mixed states recognizing the language L n with probability $\frac{3}{4} $ while any deterministic finite automaton recognizing L n needs to have at least e O(n ln n) states.
Abstract: Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable.
We use a novel proof technique based on Kolmogorov complexity to prove that there is an infinite sequence of distinct integers n such that there are languages L n in a 4-letter alphabet such that there are quantum finite automata with mixed states with 2n + 1 states recognizing the language L n with probability $\frac{3}{4} $ while any deterministic finite automaton recognizing L n needs to have at least e O(n ln n) states.
1 citations
02 Jul 1998
TL;DR: A new type of tree automaton with output as a generalization of Moore automata, which allows us to study how Moore''s gedanken-experiments, where the experimenter knows only the inputs and outputs of the automaton, are applicable to trees.
Abstract: We define a new type of tree automaton with output as a generalization of Moore automata. The new structure allows us to study how Moore''s gedanken-experiments, where the experimenter knows only the inputs and outputs of the automaton, are applicable to trees. In particular, we study simulation, minimality and universality of such automata.
1 citations
TL;DR: A model of many goaloriented stochastic automata, where each automaton adapts its structure in the process of achieving its own goal to simulate a rather important class of problems of collective behavior in large systems.
1 citations