Luc Boasson

Log. Methods Comput. Sci., 2020

2015

Rational Selecting Relations and Selectors.

[BibT_eX]

[DOI]

Olivier Carton

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Splicing Systems from Past to Future: Old and New Challenges.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2012

Splicing systems and the Chomsky hierarchy.

[BibT_eX]

[DOI]

Isabelle Fagnot

Theor. Comput. Sci., 2012

2010

Sturmian Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

The expressive power of the shuffle product.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Minimization of Automata

[BibT_eX]

[DOI]

CoRR, 2010

2009

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.

[BibT_eX]

[DOI]

Olivier Carton

Theor. Comput. Sci., 2009

Infinite words without palindrome

[BibT_eX]

[DOI]

CoRR, 2009

2007

A First Investigation of Sturmian Trees.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Operations preserving regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Mixed languages.

[BibT_eX]

[DOI]

Michel Latteux

Theor. Comput. Sci., 2005

2003

Operations Preserving Recognizable Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Shuffle factorization is unique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Formal properties of XML grammars and languages.

[BibT_eX]

[DOI]

Acta Informatica, 2002

Balanced Grammars and Their Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

Window-accumulated subsequence matching problem is linear.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2001

Effective Lossy Queue Languages.

[BibT_eX]

[DOI]

Parosh Aziz Abdulla

Ahmed Bouajjani

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

XML Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Partial Words and a Theorem of Fine and Wilf.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

A Note on List Languages.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

1997

Context-Free Languages and Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

The Set of Minimal Words of a Context-Free Language is Context-Free.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1997

The set of Lyndon words is not context-free.

[BibT_eX]

Bull. EATCS, 1997

1996

Towards an Algebraic Theory of Context-Free Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

1992

The Equivalence of pre-NTS Grammars is Decidable.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1992

1990

Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Motifs Et Bases De Langages.

[BibT_eX]

[DOI]

Michel Latteux

RAIRO Theor. Informatics Appl., 1989

1987

Groups and NTS Languages.

[BibT_eX]

[DOI]

Géraud Sénizergues

J. Comput. Syst. Sci., 1987

Langages Algébriques Déterministes Non Générateurs.

[BibT_eX]

[DOI]

Antoine Petit

RAIRO Theor. Informatics Appl., 1987

1985

NTS Languages Are Deterministic and Congruential.

[BibT_eX]

[DOI]

Géraud Sénizergues

J. Comput. Syst. Sci., 1985

Non-Générateurs Algébriques et Substitution.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1985

Deterministic Languages and Non-Generators.

[BibT_eX]

[DOI]

Antoine Petit

Proceedings of the STACS 85, 1985

1984

Remarques sur les Langages de Parenthèses.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses.

[BibT_eX]

[DOI]

Géraud Sénizergues

RAIRO Theor. Informatics Appl., 1984

Context-free grammars in Greibach normal forms.

[BibT_eX]

Joaquim Gabarró

Bull. EATCS, 1984

Bicentres de langages algébriques.

[BibT_eX]

[DOI]

Acta Informatica, 1984

1982

Indécidabilité de la Condition IRS.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

Formes de langages et de grammaires.

[BibT_eX]

[DOI]

Joffroy Beauquier

Acta Informatica, 1982

1981

Languages albébriques dominés par des langages unaires

[BibT_eX]

[DOI]

Inf. Control., January, 1981

The Rational Index: A Complexity Measure for Languages.

[BibT_eX]

[DOI]

Bruno Courcelle

SIAM J. Comput., 1981

Some Applications of CFL's over Infinte Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

Centers of Languages.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

1980

Adherences of Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

Langages sur des alphabets infinis.

[BibT_eX]

[DOI]

Joffroy Beauquier

Discret. Appl. Math., 1980

Derivations et Redutions dans les Grammaires Algebriques.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Un langage algébrique particulier.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

Quelques problèmes ouverts en théorie des langages algébriques.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

Context-Free Sets of Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

1978

A Note on 1-Locally Linear Languages

[BibT_eX]

[DOI]

Guy Cousineau

Inf. Control., April, 1978

On languages satisfying Ogden's lemma.

[BibT_eX]

[DOI]

Sándor Horváth

RAIRO Theor. Informatics Appl., 1978

1977

Le Cylindre des Langages Linéaires.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1977

Une Caractérisation des Langages Algébriques Bornés.

[BibT_eX]

[DOI]

Antonio Restivo

RAIRO Theor. Informatics Appl., 1977

Un langage algébrique non-générateur.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1977

Classification of the Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976

Langages Algebriques, Paires Iterantes et Transductions Rationnelles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

Parenthesis Generators

[BibT_eX]

[DOI]

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Le cylindre des langages linéaires n'est pas principal.

[BibT_eX]

[DOI]

Proceedings of the Automata Theory and Formal Languages, 1975

1974

Une suite decroissante de cônes rationnels.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Paires iterantes et langages algebriques.

[BibT_eX]

PhD thesis, 1974

1973

Two Iteration Theorems for Some Families of Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1973

The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1973

Sur diverses familles de langages fermées par transduction rationelle

[BibT_eX]

Acta Informatica, 1973

Familles de langages translatables et fermées par crochet

[BibT_eX]

J. P. Crestin

Acta Informatica, 1973

1972

Un critère de rationnalité des langages algébriques.

[BibT_eX]

Proceedings of the Automata, 1972

1971

An Iteration Theorem for One-Counter Languages

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

Cones rationnels et familles agreables de langages - application au langage a compteur.

[BibT_eX]