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
Journal Article•
TL;DR: It is shown that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton - a model of computation that is tightly related to other models of automata over infinite alphabets.
Abstract: In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton - a model of computation that is tightly related to other models of automata over infinite alphabets.
1 citations
10 Mar 2014
TL;DR: It is proved that it remains NP-complete even if restricted on Eulerian automata over the binary alphabet, 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 states of the automaton to one state. Deciding about the existence of a reset word of given length for a given automaton is known to be a NP-complete problem. We prove that it remains NP-complete even if restricted on Eulerian automata over the binary alphabet, as it has been conjectured by Martyugin 2011.
1 citations
01 Jan 2013
TL;DR: This chapter introduces finite automata, discusses their properties, and presents their role as recognizers of regular languages, in particular at the lexical level of compilation, and introduces regular expressions extended with the operations of complement and intersection.
Abstract: In this chapter we introduce finite automata, discuss their properties, and present their role as recognizers of regular languages, in particular at the lexical level of compilation. After an overview of general string recognition algorithms and automata, we focus on finite-state devices. We define the notions of state accessibility, determinism, spontaneous move, ambiguity, and we analyze the relations between finite automata and grammars. We present the basic constructions for cleaning, determinizing, and minimizing automata. Then we spend more time on the methods for deriving regular expressions from automata, and, conversely, for obtaining finite deterministic recognizers from regular expressions; the latter methods are also used for eliminating nondeterminism. Finally, by exploiting their relation to finite automata, we introduce regular expressions extended with the operations of complement and intersection.
1 citations
01 Jan 2022
1 citations