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 a group G has a word problem that is accepted by a deterministic counter automaton with a weak inverse property if and only if G is virtually abelian.
27 citations
01 Jan 2012
TL;DR: Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and unambiguous automata are presented, strongly unambiguous Automata, prophetic automata, guidableAutomata, and history-deterministic automata.
Abstract: We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions. The main results are underlined and some open problems proposed.
27 citations
Proceedings Article•
01 Jan 1989
TL;DR: In this paper, the authors describe several applications of automata theory to the analysis of Datalog programs, ranging from the easy to the difficult, in the hope of convincing the reader that automata-based tools provide a powerful set of abstractions and tools to database theoreticians.
Abstract: Abstract I describe several applications of automata theory to the analysis of Datalog programs, ranging from the easy to the difficult, in the hope of convincing the reader that automata theory provides a powerful set of abstractions and tools to database theoreticians.
27 citations
17 Dec 1998
TL;DR: Rational expressions are defined, a natural generalization of the usual ones over words, and a Kleene theorem connecting them to regular languages (accepted by finite branching automata) is proved, showing that recognizable languages are strictly weaker.
Abstract: This paper extends automata-theoretic techniques to unbounded parallel behaviour, as seen for instance in Petri nets. Languages are defined to be sets of (labelled) series-parallel posets – or, equivalently, sets of terms in an algebra with two product operations: sequential and parallel. In an earlier paper, we restricted ourselves to languages of posets having bounded width and introduced a notion of branching automaton. In this paper, we drop the restriction to bounded width. We define rational expressions, a natural generalization of the usual ones over words, and prove a Kleene theorem connecting them to regular languages (accepted by finite branching automata). We also show that recognizable languages (inverse images by a morphism into a finite algebra) are strictly weaker.
27 citations
01 Dec 2016
TL;DR: A new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula that has a clear logical structure, which allows for various optimizations.
Abstract: We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula $$\varphi $$ź. The automaton is the product of a co-Buchi automaton for $$\varphi $$ź and an array of Rabin automata, one for each $${\mathbf {G}}$$G-subformula of $$\varphi $$ź. The Rabin automaton for $${\mathbf {G}}\psi $$Gź is in charge of recognizing whether $${\mathbf {F}}{\mathbf {G}}\psi $$FGź holds. This information is passed to the co-Buchi automaton that decides on acceptance. As opposed to standard procedures based on Safra's determinization, the states of all our automata have a clear logical structure, which allows for various optimizations. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.
27 citations