Luc Boasson

Jean Berstel, Luc Boasson, Isabelle Fagnot: Splicing systems and the Chomsky hierarchy. Theor. Comput. Sci. 436: 2-22 (2012)

Jean Berstel, Luc Boasson, Isabelle Fagnot: Splicing systems and the Chomsky hierarchy. CoRR abs/1102.0947 (2011)

Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo: The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Minimization of Automata. CoRR abs/1010.5318 (2010)

Jean Berstel, Luc Boasson, Olivier Carton: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Infinite words without palindrome. CoRR abs/0903.2382 (2009)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: A First Investigation of Sturmian Trees. STACS 2007: 73-84

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006)

Jean Berstel, Luc Boasson, Michel Latteux: Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005)

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations Preserving Recognizable Languages. FCT 2003: 343-354

Jean Berstel, Luc Boasson: Formal properties of XML grammars and languages. Acta Inf. 38(9): 649-671 (2002)

Jean Berstel, Luc Boasson: Shuffle factorization is unique. Theor. Comput. Sci. 273(1-2): 47-67 (2002)

Jean Berstel, Luc Boasson: Balanced Grammars and Their Languages. Formal and Natural Computing 2002: 3-25

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Window-accumulated subsequence matching problem is linear. Ann. Pure Appl. Logic 113(1-3): 59-80 (2001)

Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani: Effective Lossy Queue Languages. ICALP 2001: 639-651

Jean Berstel, Luc Boasson: XML Grammars. MFCS 2000: 182-191

Jean Berstel, Luc Boasson: Formal Properties of XML Grammars and Languages. CoRR cs.DM/0011011 (2000)

Jean Berstel, Luc Boasson: A Note on List Languages. IJAC 9(3-4): 263-270 (1999)

Jean Berstel, Luc Boasson: Partial Words and a Theorem of Fine and Wilf. Theor. Comput. Sci. 218(1): 135-141 (1999)

Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Window-Accumulated Subsequence Matching Problem is Linear. PODS 1999: 327-336

Jean Berstel, Luc Boasson: The set of Lyndon words is not context-free. Bulletin of the EATCS 63 (1997)

Jean Berstel, Luc Boasson: The Set of Minimal Words of a Context-Free Language is Context-Free. J. Comput. Syst. Sci. 55(3): 477-488 (1997)

Jean Berstel, Luc Boasson: Towards an Algebraic Theory of Context-Free Languages. Fundam. Inform. 25(3): 217-239 (1996)

Jean-Michel Autebert, Luc Boasson: The Equivalence of pre-NTS Grammars is Decidable. Mathematical Systems Theory 25(1): 61-74 (1992)

Jean Berstel, Luc Boasson: Context-Free Languages. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 59-102

Jean-Michel Autebert, Luc Boasson, Michel Latteux: Motifs Et Bases De Langages. ITA 23(4): 379-393 (1989)

Luc Boasson, Antoine Petit: Langages Algébriques Déterministes Non Générateurs. ITA 21(1): 41-57 (1987)

Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues: Groups and NTS Languages. J. Comput. Syst. Sci. 35(2): 243-267 (1987)

Luc Boasson: Non-Générateurs Algébriques et Substitution. ITA 19(2): 125-136 (1985)

Luc Boasson, Géraud Sénizergues: NTS Languages Are Deterministic and Congruential. J. Comput. Syst. Sci. 31(3): 332-342 (1985)

Luc Boasson, Antoine Petit: Deterministic Languages and Non-Generators. STACS 1985: 39-46

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire: Bicentres de langages algébriques. Acta Inf. 21: 209-227 (1984)

Jean-Michel Autebert, Luc Boasson, Joaquim Gabarró: Context-free grammars in Greibach normal forms. Bulletin of the EATCS 24: 44-47 (1984)

Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues: Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses. ITA 18(4): 327-344 (1984)

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues: Remarques sur les Langages de Parenthèses. Theor. Comput. Sci. 31: 337-349 (1984)

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson: Formes de langages et de grammaires. Acta Inf. 17: 193-213 (1982)

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux: Indécidabilité de la Condition IRS. ITA 16(2): 129-138 (1982)

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux: Languages albébriques dominés par des langages unaires. Information and Control 48(1): 49-53 (1981)

Luc Boasson, Bruno Courcelle, Maurice Nivat: The Rational Index: A Complexity Measure for Languages. SIAM J. Comput. 10(2): 284-296 (1981)

Luc Boasson: Some Applications of CFL's over Infinte Alphabets. Theoretical Computer Science 1981: 146-151

Luc Boasson, Maurice Nivat: Centers of Languages. Theoretical Computer Science 1981: 245-251

Luc Boasson, Maurice Nivat: Adherences of Languages. J. Comput. Syst. Sci. 20(3): 285-309 (1980)

Luc Boasson: Derivations et Redutions dans les Grammaires Algebriques. ICALP 1980: 109-118

Luc Boasson: Un langage algébrique particulier. ITA 13(3) (1979)

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Maurice Nivat: Quelques problèmes ouverts en théorie des langages algébriques. ITA 13(4) (1979)

Luc Boasson: Context-Free Sets of Infinite Words. Theoretical Computer Science 1979: 1-9

Jean-Michel Autebert, Luc Boasson, Guy Cousineau: A Note on 1-Locally Linear Languages. Information and Control 37(1): 1-4 (1978)

Luc Boasson, Sándor Horváth: On languages satisfying Ogden's lemma. ITA 12(3) (1978)

Luc Boasson, Antonio Restivo: Une Caractérisation des Langages Algébriques Bornés. ITA 11(3): 203-205 (1977)

Luc Boasson, Maurice Nivat: Le Cylindre des Langages Linéaires. Mathematical Systems Theory 11: 147-155 (1977)

Luc Boasson: Classification of the Context-Free Languages. MFCS 1977: 34-43

Luc Boasson: Un langage algébrique non-générateur. Theoretical Computer Science 1977: 145-148

Luc Boasson: Langages Algebriques, Paires Iterantes et Transductions Rationnelles. Theor. Comput. Sci. 2(2): 209-223 (1976)

Luc Boasson, Maurice Nivat: Parenthesis Generators. FOCS 1976: 253-257

Luc Boasson, Maurice Nivat: Le cylindre des langages linéaires n'est pas principal. Automata Theory and Formal Languages 1975: 16-19

Luc Boasson: on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. MFCS 1975: 194-198

Luc Boasson: Paires iterantes et langages algebriques. Univ. Paris VII 1974, pp. I-VII, 1-164

Jean Berstel, Luc Boasson: Une suite decroissante de cônes rationnels. ICALP 1974: 383-397

Luc Boasson, Maurice Nivat: Sur diverses familles de langages fermées par transductions rationelle. Acta Inf. 2: 180-188 (1973)

Luc Boasson, J. P. Crestin, Maurice Nivat: Familles de langages translatables et fermées par crochet. Acta Inf. 2: 383-393 (1973)

Luc Boasson: 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. 2(5): 135-140 (1973)

Luc Boasson: Two Iteration Theorems for Some Families of Languages. J. Comput. Syst. Sci. 7(6): 583-596 (1973)

Luc Boasson: Un critère de rationnalité des langages algébriques. ICALP 1972: 359-365

Luc Boasson: Cones rationnels et familles agreables de langages - application au langage a compteur. Univ. Paris VII 1971, pp. 1-94

Luc Boasson: An Iteration Theorem for One-Counter Languages. STOC 1971: 116-120