Add to ORKGQuasi-star-free languages were first introduced and studied by Bar-rington, Compton, Straubing and Thérien within the context of circuit complexity in 1992, and their connections with propositional linear tem-poral logic were established by Ésik and Ito recently. While these results are all for finite words, in this paper we consider the languages on infinite words.
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
A classic result in formal language theory is the equivalence among aperiodic finite automata, star-...
This paper contains answers to several problems in the theory of the computational complexity of inf...
AbstractIn this paper, we give an algebraic proof of the equivalence between temporal logic and star...
AbstractLet A be a finite alphabet and A∗ the free monoid generated by A. A language is any subset o...
International audienceThis paper contains extensions to words on countable scattered linear ordering...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractThis paper contains extensions to words on countable scattered linear orderings of two well-...
Expressiveness, and more recently, succinctness, are two central concerns of finite model theory and...
AbstractLet n be a fixed integer; we extend the theorem of Schützenberger, McNaughton, and Papert on...
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. ...
AbstractThis paper contains answers to several problems in the theory of the computational complexit...
© 2013, Springer Science+Business Media New York. In 1965 Sch ̈utzenberger published his famous resu...
AbstractA language L over the Cartesian product of component alphabets is called projective if it is...
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
A classic result in formal language theory is the equivalence among aperiodic finite automata, star-...
This paper contains answers to several problems in the theory of the computational complexity of inf...
AbstractIn this paper, we give an algebraic proof of the equivalence between temporal logic and star...
AbstractLet A be a finite alphabet and A∗ the free monoid generated by A. A language is any subset o...
International audienceThis paper contains extensions to words on countable scattered linear ordering...
AbstractThe main result of this paper is the extension of the theorem of Schützenberger, McNaughton,...
AbstractThis paper contains extensions to words on countable scattered linear orderings of two well-...
Expressiveness, and more recently, succinctness, are two central concerns of finite model theory and...
AbstractLet n be a fixed integer; we extend the theorem of Schützenberger, McNaughton, and Papert on...
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. ...
AbstractThis paper contains answers to several problems in the theory of the computational complexit...
© 2013, Springer Science+Business Media New York. In 1965 Sch ̈utzenberger published his famous resu...
AbstractA language L over the Cartesian product of component alphabets is called projective if it is...
We show that there are Σ03-complete languages of infinite words ac-cepted by non-deterministic Petri...
A classic result in formal language theory is the equivalence among aperiodic finite automata, star-...
This paper contains answers to several problems in the theory of the computational complexity of inf...