AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accepting conditions which are based on whether the automaton enters all of its accepting states infinitely many times or not. We investigate the classes of ω-languages defined thereby in relation to other well-known subclasses of the class of ω-regular languages
AbstractWagner and Staiger (1977) characterized in the recursion-theoretic hierarchies the classes o...
The regular ω-languages can be defined by deterministic ω-automata with the Rabin acceptance conditi...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
AbstractIn this paper, we give language-theoretical representations for some classes of ω- languages...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
AbstractG-machines are considered as generators of sets of finite and infinite sequences, called G-l...
AbstractWe consider deterministic and nondeterministic finite automata with acceptance conditions th...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
AbstractFor any storage type X, the ω-languages accepted by X-automata are investigated. Six accepti...
AbstractThis paper is a continuation of the work by Landweber [5], to clarify the relationship betwe...
AbstractWagner and Staiger (1977) characterized in the recursion-theoretic hierarchies the classes o...
The regular ω-languages can be defined by deterministic ω-automata with the Rabin acceptance conditi...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
AbstractIn this paper, we give language-theoretical representations for some classes of ω- languages...
AbstractIn this paper we consider the following two types of finite acceptance of infinite words by ...
AbstractFirst-order formulas are used to specify various ways of acceptance of ω-languages by (deter...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
AbstractG-machines are considered as generators of sets of finite and infinite sequences, called G-l...
AbstractWe consider deterministic and nondeterministic finite automata with acceptance conditions th...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
AbstractFor any storage type X, the ω-languages accepted by X-automata are investigated. Six accepti...
AbstractThis paper is a continuation of the work by Landweber [5], to clarify the relationship betwe...
AbstractWagner and Staiger (1977) characterized in the recursion-theoretic hierarchies the classes o...
The regular ω-languages can be defined by deterministic ω-automata with the Rabin acceptance conditi...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
DOI
Add to ORKG