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 it remains NP-complete even if restricted to Eulerian automata with binary alphabets as it has been conjectured by Martyugin (2011).
Abstract: A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets as it has been conjectured by Martyugin (2011).
4 citations
TL;DR: In this article, an algebra for composing automata which includes both classical and quantum entities is described, and a quantum protocol for quantum automata is described by describing in detail a quantum quantum protocol.
4 citations
Journal Article•
TL;DR: It is shown how this concept of parenthesizing automaton can be generalized for infinite biposets in a way that the equivalence of regularity, recognizability and MSO-definability remains true.
Abstract: Bisemigroups are algebras equipped with two independent associative operations. Labeled finite sp-biposets may serve as a possible representation of the elements of the free bisemigroups. For finite sp-biposets, an accepting device, called parenthesizing automaton, was introduced in [6], and it was proved that its expressive power is equivalent to both algebraic recognizability and monadic second order definability. In this paper, we show, how this concept of parenthesizing automaton can be generalized for infinite biposets in a way that the equivalence of regularity (defined by acceptance with automata), recognizability (defined by homomorphisms and finite ω-bisemigroups) and MSO-definability remains true.
4 citations
17 Jul 1999
TL;DR: The system SEA is presented, which integrates manipulations over boolean and multiplicity automata and provides also self development facilities.
Abstract: We here present the system SEA which integrates manipulations over boolean and multiplicity automata. The system provides also self development facilities.
4 citations
27 Aug 2012
TL;DR: This paper introduces automata plans, which consist of hierarchies of finite state automata which can be viewed as an extension of macros that enables parametrization and branching, and proves that automata Plans are strictly more expressive than macro plans.
Abstract: Macros have a long-standing role in planning as a tool for representing repeating subsequences of operators. Macros are useful both for guiding search towards a solution and for representing plans compactly. In this paper we introduce automata plans which consist of hierarchies of finite state automata. Automata plans can be viewed as an extension of macros that enables parametrization and branching. We provide several examples of the utility of automata plans, and prove that automata plans are strictly more expressive than macro plans. We also prove that automata plans admit polynomial-time sequential access of the operators in the underlying "flat" plan, and identify a subset of automata plans that admit polynomial-time random access. Finally, we compare automata plans with other representations allowing polynomial-time sequential access.
4 citations