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: The paper establishes the exact computational complexity of solving average-time games: the problem is EXPTIME-complete for timed automata with at least two clocks.
Abstract: An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimise the average time per transition and player Max wants to maximise it. A solution of average-time games is presented using a reduction to average-price game on a finite graph. A direct consequence is an elementary proof of determinacy for average-time games. This complements our results for reachability-time games and partially solves a problem posed by Bouyer et al., to design an algorithm for solving average-price games on priced timed automata. The paper also establishes the exact computational complexity of solving average-time games: the problem is EXPTIME-complete for timed automata with at least two clocks.
4 citations
18 Aug 2010
TL;DR: A new proof is given for the fact that measure-many one-way quantum finite automata (MM-1QFA) recognize only regular languages with bounded error and generalizes the proof to a broader class of automata that include probabilistic automata and some kinds of quantum finite Automata.
Abstract: We give a new proof for the fact that measure-many one-way quantum finite automata (MM-1QFA) recognize only regular languages with bounded error. Our proof, different from the one in the literature, gives another insight to the recognition power of MM-1QFA. Moreover, we generalize the proof to a broader class of automata that include probabilistic automata and some kinds of quantum finite automata. In addition, we briefly discuss the equivalence problem of some quantum computing models in a uniform framework.
4 citations
17 Apr 2007
TL;DR: An approach to simplify Büchi automata by fair simulation, which is based on integrating themethod of [6] and conditions of [7], which can optimize an automaton without changing the language of each state and apply the optimization immediately after finding one pair of states with fair simulation equivalence.
Abstract: State space reduction for automata is important to automata-theoretic model checking. Optimizing automata by simulation relation is a practical method. We propose an approach to simplify Buchi automata by fair simulation, which is based on integrating themethod of [6] and conditions of [7]. The approach can optimize an automaton without changing the language of each state and apply the optimization immediately after finding one pair of states with fair simulation equivalence. The experimental result shows our approach needs less time than that of [6].
4 citations
TL;DR: In this article, the authors apply the defining diagrams of algebras, coalgebraic automata, and bialgebraic structures to categories of semimodules and homomorphisms over a commutative semiring.
4 citations
19 Jan 2001
TL;DR: In this paper, a model of two-way quantum one-counter automata (2Q1CAs) was introduced, and it was shown that these automata are at least as powerful as deterministic one-counters.
Abstract: After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum finite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum one-counter automata (1Q1CAs) by Kravtsev. We give the definition of 2Q1CAs with well-formedness conditions. It is proved that 2Q1CAs are at least as powerful as classical two-way deterministic one-counter automata (2D1CAs), that is, every language L recognizable by 2D1CAs is recognized by 2Q1CAs with no error. It is also shown that several non-context-free languages including {a^n b^{n^2}} and {a^n b^{2^n}} are recognizable by 2Q1CAs with bounded error.
4 citations