Luc Boasson

75 papers A* 7A 2B 4C 2Journal 48Unranked 7
YearRankTypeTitle / Venue / Authors
2021 — ch.
Minimisation of automata.
Handbook of Automata Theory (I.)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2020 J jnl
Transfinite Lyndon words.
Log. Methods Comput. Sci.
Olivier Carton, Luc Boasson
2018 J jnl
Transfinite Lyndon words.
CoRR
Olivier Carton, Luc Boasson
2015 C conf
Rational Selecting Relations and Selectors.
LATA
Luc Boasson, Olivier Carton
2015 J jnl
Splicing Systems from Past to Future: Old and New Challenges.
CoRR
Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza
2015 C conf
Transfinite Lyndon Words.
DLT
Luc Boasson, Olivier Carton
2014 — conf
Splicing Systems from Past to Future: Old and New Challenges.
Discrete Mathematics and Computer Science
Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza
2012 J jnl
Splicing systems and the Chomsky hierarchy.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Isabelle Fagnot
2011 J jnl
Splicing systems and the Chomsky hierarchy
CoRR
Jean Berstel, Luc Boasson, Isabelle Fagnot
2010 J jnl
Minimization of Automata
CoRR
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2010 J jnl
Sturmian Trees.
Theory Comput. Syst.
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2010 J jnl
The expressive power of the shuffle product.
Inf. Comput.
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo
2009 J jnl
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Olivier Carton
2009 J jnl
Infinite words without palindrome
CoRR
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2007 A conf
A First Investigation of Sturmian Trees.
STACS
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2006 J jnl
Operations preserving regular languages.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
2005 J jnl
Mixed languages.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Michel Latteux
2003 B conf
Operations Preserving Recognizable Languages.
FCT
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
2002 — conf
Balanced Grammars and Their Languages.
Formal and Natural Computing
Jean Berstel, Luc Boasson
2002 J jnl
Formal properties of XML grammars and languages.
Acta Informatica
Jean Berstel, Luc Boasson
2002 J jnl
Shuffle factorization is unique.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson
2001 A* conf
Effective Lossy Queue Languages.
ICALP
Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani
2001 J jnl
Window-accumulated subsequence matching problem is linear.
Ann. Pure Appl. Log.
Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
2000 J jnl
Formal Properties of XML Grammars and Languages
CoRR
Jean Berstel, Luc Boasson
2000 B conf
XML Grammars.
MFCS
Jean Berstel, Luc Boasson
1999 J jnl
A Note on List Languages.
Int. J. Algebra Comput.
Jean Berstel, Luc Boasson
1999 J jnl
Partial Words and a Theorem of Fine and Wilf.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson
1999 A* conf
Window-Accumulated Subsequence Matching Problem is Linear.
PODS
Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
1997 — ch.
Context-Free Languages and Pushdown Automata.
Handbook of Formal Languages (1)
Jean-Michel Autebert, Jean Berstel, Luc Boasson
1997 J jnl
The Set of Minimal Words of a Context-Free Language is Context-Free.
J. Comput. Syst. Sci.
Jean Berstel, Luc Boasson
1997 J jnl
The set of Lyndon words is not context-free.
Bull. EATCS
Jean Berstel, Luc Boasson
1996 J jnl
Towards an Algebraic Theory of Context-Free Languages.
Fundam. Informaticae
Jean Berstel, Luc Boasson
1992 J jnl
The Equivalence of pre-NTS Grammars is Decidable.
Math. Syst. Theory
Jean-Michel Autebert, Luc Boasson
1990 — ch.
Context-Free Languages.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
Jean Berstel, Luc Boasson
1989 J jnl
Motifs Et Bases De Langages.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Luc Boasson, Michel Latteux
1987 J jnl
Groups and NTS Languages.
J. Comput. Syst. Sci.
Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
1987 J jnl
Langages Algébriques Déterministes Non Générateurs.
RAIRO Theor. Informatics Appl.
Luc Boasson, Antoine Petit
1985 A conf
Deterministic Languages and Non-Generators.
STACS
Luc Boasson, Antoine Petit
1985 J jnl
NTS Languages Are Deterministic and Congruential.
J. Comput. Syst. Sci.
Luc Boasson, Géraud Sénizergues
1985 J jnl
Non-Générateurs Algébriques et Substitution.
RAIRO Theor. Informatics Appl.
Luc Boasson
1984 J jnl
Bicentres de langages algébriques.
Acta Informatica
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire
1984 J jnl
Context-free grammars in Greibach normal forms.
Bull. EATCS
Jean-Michel Autebert, Luc Boasson, Joaquim Gabarró
1984 J jnl
Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
1984 J jnl
Remarques sur les Langages de Parenthèses.
Theor. Comput. Sci.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues
1982 J jnl
Formes de langages et de grammaires.
Acta Informatica
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson
1982 J jnl
Indécidabilité de la Condition IRS.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux
1981 — conf
Centers of Languages.
Theoretical Computer Science
Luc Boasson, Maurice Nivat
1981 J jnl
Languages albébriques dominés par des langages unaires
Inf. Control.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux
1981 — conf
Some Applications of CFL's over Infinte Alphabets.
Theoretical Computer Science
Luc Boasson
1981 J jnl
The Rational Index: A Complexity Measure for Languages.
SIAM J. Comput.
Luc Boasson, Bruno Courcelle, Maurice Nivat
1980 J jnl
Adherences of Languages.
J. Comput. Syst. Sci.
Luc Boasson, Maurice Nivat
1980 A* conf
Derivations et Redutions dans les Grammaires Algebriques.
ICALP
Luc Boasson
1980 J jnl
Langages sur des alphabets infinis.
Discret. Appl. Math.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson
1979 — conf
Context-Free Sets of Infinite Words.
Theoretical Computer Science
Luc Boasson
1979 J jnl
Quelques problèmes ouverts en théorie des langages algébriques.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Maurice Nivat
1979 J jnl
Un langage algébrique particulier.
RAIRO Theor. Informatics Appl.
Luc Boasson
1978 J jnl
A Note on 1-Locally Linear Languages
Inf. Control.
Jean-Michel Autebert, Luc Boasson, Guy Cousineau
1978 J jnl
On languages satisfying Ogden's lemma.
RAIRO Theor. Informatics Appl.
Luc Boasson, Sándor Horváth
1977 B conf
Classification of the Context-Free Languages.
MFCS
Luc Boasson
1977 J jnl
Le Cylindre des Langages Linéaires.
Math. Syst. Theory
Luc Boasson, Maurice Nivat
1977 — conf
Un langage algébrique non-générateur.
Theoretical Computer Science
Luc Boasson
1977 J jnl
Une Caractérisation des Langages Algébriques Bornés.
RAIRO Theor. Informatics Appl.
Luc Boasson, Antonio Restivo
1976 J jnl
Langages Algebriques, Paires Iterantes et Transductions Rationnelles.
Theor. Comput. Sci.
Luc Boasson
1976 A* conf
Parenthesis Generators
FOCS
Luc Boasson, Maurice Nivat
1975 — conf
Le cylindre des langages linéaires n'est pas principal.
Automata Theory and Formal Languages
Luc Boasson, Maurice Nivat
1975 B conf
on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages.
MFCS
Luc Boasson
1974 — —
Paires iterantes et langages algebriques.
Luc Boasson
1974 A* conf
Une suite decroissante de cônes rationnels.
ICALP
Jean Berstel, Luc Boasson
1973 J jnl
Familles de langages translatables et fermées par crochet
Acta Informatica
Luc Boasson, J. P. Crestin, Maurice Nivat
1973 J jnl
Sur diverses familles de langages fermées par transduction rationelle
Acta Informatica
Luc Boasson, Maurice Nivat
1973 J jnl
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.
Inf. Process. Lett.
Luc Boasson
1973 J jnl
Two Iteration Theorems for Some Families of Languages.
J. Comput. Syst. Sci.
Luc Boasson
1972 A* conf
Un critère de rationnalité des langages algébriques.
ICALP
Luc Boasson
1971 A* conf
An Iteration Theorem for One-Counter Languages
STOC
Luc Boasson
1971 — —
Cones rationnels et familles agreables de langages - application au langage a compteur.
Luc Boasson