AbstractEvery infinitary deterministic rational language is the limit of a finitary rational one and conversely.This standard result extends to languages of two-sided infinite words. So, the family of deterministic rational languages of two-sided infinite words is equal to the one of bilimits of finitary rational languages
The algebraic theory of rational languages has provided powerful decidability results. Among them, o...
AbstractWe prove that every rational Ω-language can be recognized by a non-ambiguous automaton, i.e....
AbstractAn ω-language over a finite alphabet X is a set of infinite sequences of letters of X. In th...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
We study the connections between rational series with coefficients in a semiring and their languages...
AbstractWe state and prove an infinite alphabet counterpart of the classical Myhill–Nerode theorem
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
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 proposes three possible definitions of context-free languages over infinite alpha...
Abstract: In this paper continuous fractions are treated as description language of ration...
Cet article avait été initialement soumis à la partie Contributions du bulletin (les articles y sont...
This thesis deals with the languages of infinite words which are the ω-powers of a language of finit...
SIGLETechnische Informationsbibliothek Hannover: RN 7281 (39) / FIZ - Fachinformationszzentrum Karls...
The algebraic theory of rational languages has provided powerful decidability results. Among them, o...
AbstractWe prove that every rational Ω-language can be recognized by a non-ambiguous automaton, i.e....
AbstractAn ω-language over a finite alphabet X is a set of infinite sequences of letters of X. In th...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
We study the connections between rational series with coefficients in a semiring and their languages...
AbstractWe state and prove an infinite alphabet counterpart of the classical Myhill–Nerode theorem
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
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 proposes three possible definitions of context-free languages over infinite alpha...
Abstract: In this paper continuous fractions are treated as description language of ration...
Cet article avait été initialement soumis à la partie Contributions du bulletin (les articles y sont...
This thesis deals with the languages of infinite words which are the ω-powers of a language of finit...
SIGLETechnische Informationsbibliothek Hannover: RN 7281 (39) / FIZ - Fachinformationszzentrum Karls...
The algebraic theory of rational languages has provided powerful decidability results. Among them, o...
AbstractWe prove that every rational Ω-language can be recognized by a non-ambiguous automaton, i.e....
AbstractAn ω-language over a finite alphabet X is a set of infinite sequences of letters of X. In th...
DOI
Add to ORKG