Luc Boasson

According to our database1, Luc Boasson authored at least 73 papers between 1971 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Transfinite Lyndon words.
CoRR, 2018

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

Rational Selecting Relations and Selectors.
Proceedings of the Language and Automata Theory and Applications, 2015

Transfinite Lyndon Words.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Splicing Systems from Past to Future: Old and New Challenges.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

Splicing systems and the Chomsky hierarchy.
Theor. Comput. Sci., 2012

Splicing systems and the Chomsky hierarchy
CoRR, 2011

Sturmian Trees.
Theory Comput. Syst., 2010

The expressive power of the shuffle product.
Inf. Comput., 2010

Minimization of Automata
CoRR, 2010

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
Theor. Comput. Sci., 2009

Infinite words without palindrome
CoRR, 2009

A First Investigation of Sturmian Trees.
Proceedings of the STACS 2007, 2007

Operations preserving regular languages.
Theor. Comput. Sci., 2006

Mixed languages.
Theor. Comput. Sci., 2005

Operations Preserving Recognizable Languages.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Shuffle factorization is unique.
Theor. Comput. Sci., 2002

Formal properties of XML grammars and languages.
Acta Inf., 2002

Balanced Grammars and Their Languages.
Proceedings of the Formal and Natural Computing, 2002

Window-accumulated subsequence matching problem is linear.
Ann. Pure Appl. Logic, 2001

Effective Lossy Queue Languages.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Formal Properties of XML Grammars and Languages
CoRR, 2000

XML Grammars.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Partial Words and a Theorem of Fine and Wilf.
Theor. Comput. Sci., 1999

A Note on List Languages.
IJAC, 1999

Window-Accumulated Subsequence Matching Problem is Linear.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Context-Free Languages and Pushdown Automata.
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.
J. Comput. Syst. Sci., 1997

The set of Lyndon words is not context-free.
Bulletin of the EATCS, 1997

Towards an Algebraic Theory of Context-Free Languages.
Fundam. Inform., 1996

The Equivalence of pre-NTS Grammars is Decidable.
Mathematical Systems Theory, 1992

Context-Free Languages.
Proceedings of the Handbook of Theoretical Computer Science, 1990

Motifs Et Bases De Langages.
ITA, 1989

Groups and NTS Languages.
J. Comput. Syst. Sci., 1987

Langages Algébriques Déterministes Non Générateurs.
ITA, 1987

NTS Languages Are Deterministic and Congruential.
J. Comput. Syst. Sci., 1985

Non-Générateurs Algébriques et Substitution.
ITA, 1985

Deterministic Languages and Non-Generators.
Proceedings of the STACS 85, 1985

Remarques sur les Langages de Parenthèses.
Theor. Comput. Sci., 1984

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

Context-free grammars in Greibach normal forms.
Bulletin of the EATCS, 1984

Bicentres de langages algébriques.
Acta Inf., 1984

Indécidabilité de la Condition IRS.
ITA, 1982

Formes de langages et de grammaires.
Acta Inf., 1982

Languages albébriques dominés par des langages unaires
Information and Control, January, 1981

The Rational Index: A Complexity Measure for Languages.
SIAM J. Comput., 1981

Some Applications of CFL's over Infinte Alphabets.
Proceedings of the Theoretical Computer Science, 1981

Centers of Languages.
Proceedings of the Theoretical Computer Science, 1981

Adherences of Languages.
J. Comput. Syst. Sci., 1980

Langages sur des alphabets infinis.
Discrete Applied Mathematics, 1980

Derivations et Redutions dans les Grammaires Algebriques.
Proceedings of the Automata, 1980

Un langage algébrique particulier.
ITA, 1979

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

Context-Free Sets of Infinite Words.
Proceedings of the Theoretical Computer Science, 1979

A Note on 1-Locally Linear Languages
Information and Control, April, 1978

On languages satisfying Ogden's lemma.
ITA, 1978

Le Cylindre des Langages Linéaires.
Mathematical Systems Theory, 1977

Une Caractérisation des Langages Algébriques Bornés.
ITA, 1977

Un langage algébrique non-générateur.
Proceedings of the Theoretical Computer Science, 1977

Classification of the Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Langages Algebriques, Paires Iterantes et Transductions Rationnelles.
Theor. Comput. Sci., 1976

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

on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Le cylindre des langages linéaires n'est pas principal.
Proceedings of the Automata Theory and Formal Languages, 1975

Une suite decroissante de cônes rationnels.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Paires iterantes et langages algebriques.
PhD thesis, 1974

Two Iteration Theorems for Some Families of Languages.
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.
Inf. Process. Lett., 1973

Sur diverses familles de langages fermées par transductions rationelle
Acta Inf., 1973

Familles de langages translatables et fermées par crochet
Acta Inf., 1973

Un critère de rationnalité des langages algébriques.
Proceedings of the Automata, 1972

An Iteration Theorem for One-Counter Languages
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

Cones rationnels et familles agreables de langages - application au langage a compteur.
PhD thesis, 1971