DOIAbstract
AbstractWe prove that every rational Ω-language can be recognized by a non-ambiguous automaton, i.e., an automation which accepts every infinite word in at most one way
AbstractWe prove that every rational Ω-language can be recognized by a non-ambiguous automaton, i.e., an automation which accepts every infinite word in at most one way
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
AbstractIn this paper, we introduce a special class of Büchi automata called unambiguous. In these a...
AbstractWe prove that every FTR-language R (factorial, transitive, rational) admits a minimal irredu...
The full scan condition on a language L introduced in [1] ensures that a word w must be completely i...
An automaton is unambiguous if for every input it has at most one acceptingcomputation. An automaton...
An ω-language is a set consisting of ω-length strings over some alphabet; an ω-automaton is a device...
The algebraic theory of rational languages has provided powerful decidability results. Among them, o...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
Abstract. Büchi automata are used to recognize languages of infinite words. Such languages have been...
24 pagesInternational audienceWe investigate families of infinite automata for context-sensitive lan...
International audienceWe present a new approach to define boolean algebras of various language famil...
Abstract. In the hierarchy of infinite graph families, rational graphs are defined by rational trans...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
AbstractIn this paper, we introduce a special class of Büchi automata called unambiguous. In these a...
AbstractWe prove that every FTR-language R (factorial, transitive, rational) admits a minimal irredu...
The full scan condition on a language L introduced in [1] ensures that a word w must be completely i...
An automaton is unambiguous if for every input it has at most one acceptingcomputation. An automaton...
An ω-language is a set consisting of ω-length strings over some alphabet; an ω-automaton is a device...
The algebraic theory of rational languages has provided powerful decidability results. Among them, o...
AbstractIn this paper we study the ω-languages accepted by finite automata under a new type of accep...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
Abstract. Büchi automata are used to recognize languages of infinite words. Such languages have been...
24 pagesInternational audienceWe investigate families of infinite automata for context-sensitive lan...
International audienceWe present a new approach to define boolean algebras of various language famil...
Abstract. In the hierarchy of infinite graph families, rational graphs are defined by rational trans...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
Add to ORKG