AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton, and Papert on star-free sets of finite words to languages of words of countable length. We also give another proof of the theorem of Büchi which establishes the equivalence between automata and monadic second-order sentences for defining sets of words of denumerable length
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Abstract. We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform ar...
International audienceWe prove that every rational language of words indexed by linear orderings is ...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractLet n be a fixed integer; we extend the theorem of Schützenberger, McNaughton, and Papert on...
AbstractSeveral definitions of automata on words indexed by ordinals have been proposed previously. ...
AbstractIn this paper, we give an algebraic proof of the equivalence between temporal logic and star...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
International audienceThis paper contains extensions to words on countable scattered linear ordering...
AbstractThis paper contains extensions to words on countable scattered linear orderings of two well-...
AbstractWe investigate properties of locally finite languages introduced by Ressayre (J. Symbolic Lo...
We study the strength of axioms needed to prove various results related to automata on infinite word...
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to pr...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
Abstract We show that a special case of the Feferman-Vaught composition theorem gives rise to a natu...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Abstract. We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform ar...
International audienceWe prove that every rational language of words indexed by linear orderings is ...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractLet n be a fixed integer; we extend the theorem of Schützenberger, McNaughton, and Papert on...
AbstractSeveral definitions of automata on words indexed by ordinals have been proposed previously. ...
AbstractIn this paper, we give an algebraic proof of the equivalence between temporal logic and star...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
International audienceThis paper contains extensions to words on countable scattered linear ordering...
AbstractThis paper contains extensions to words on countable scattered linear orderings of two well-...
AbstractWe investigate properties of locally finite languages introduced by Ressayre (J. Symbolic Lo...
We study the strength of axioms needed to prove various results related to automata on infinite word...
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to pr...
We define a new class of languages of $\omega$-words, strictly extending$\omega$-regular languages. ...
Abstract We show that a special case of the Feferman-Vaught composition theorem gives rise to a natu...
Automata theory arose as an interdisciplinary field, with roots in several scientific domains such a...
Abstract. We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform ar...
International audienceWe prove that every rational language of words indexed by linear orderings is ...
DOI
Add to ORKG