| 2009 |
|---|
| 57 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Isabelle Fagnot:
Infinite words without palindrome
CoRR abs/0903.2382: (2009) |
| 2007 |
|---|
| 56 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Isabelle Fagnot:
A First Investigation of Sturmian Trees.
STACS 2007: 73-84 |
| 2006 |
|---|
| 55 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations preserving regular languages.
Theor. Comput. Sci. 354(3): 405-420 (2006) |
| 2005 |
|---|
| 54 | EE | Jean Berstel,
Luc Boasson,
Michel Latteux:
Mixed languages.
Theor. Comput. Sci. 332(1-3): 179-198 (2005) |
| 2003 |
|---|
| 53 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations Preserving Recognizable Languages.
FCT 2003: 343-354 |
| 2002 |
|---|
| 52 | EE | Jean Berstel,
Luc Boasson:
Balanced Grammars and Their Languages.
Formal and Natural Computing 2002: 3-25 |
| 51 | EE | Jean Berstel,
Luc Boasson:
Formal properties of XML grammars and languages.
Acta Inf. 38(9): 649-671 (2002) |
| 50 | EE | Jean Berstel,
Luc Boasson:
Shuffle factorization is unique.
Theor. Comput. Sci. 273(1-2): 47-67 (2002) |
| 2001 |
|---|
| 49 | EE | Parosh Aziz Abdulla,
Luc Boasson,
Ahmed Bouajjani:
Effective Lossy Queue Languages.
ICALP 2001: 639-651 |
| 48 | | 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) |
| 2000 |
|---|
| 47 | EE | Jean Berstel,
Luc Boasson:
XML Grammars.
MFCS 2000: 182-191 |
| 46 | EE | Jean Berstel,
Luc Boasson:
Formal Properties of XML Grammars and Languages
CoRR cs.DM/0011011: (2000) |
| 1999 |
|---|
| 45 | EE | Luc Boasson,
Patrick Cégielski,
Irène Guessarian,
Yuri Matiyasevich:
Window-Accumulated Subsequence Matching Problem is Linear.
PODS 1999: 327-336 |
| 44 | EE | Jean Berstel,
Luc Boasson:
Partial Words and a Theorem of Fine and Wilf.
Theor. Comput. Sci. 218(1): 135-141 (1999) |
| 1997 |
|---|
| 43 | | Jean Berstel,
Luc Boasson:
The set of Lyndon words is not context-free.
Bulletin of the EATCS 63: (1997) |
| 42 | | 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) |
| 1996 |
|---|
| 41 | | Jean Berstel,
Luc Boasson:
Towards an Algebraic Theory of Context-Free Languages.
Fundam. Inform. 25(3): 217-239 (1996) |
| 1992 |
|---|
| 40 | | Jean-Michel Autebert,
Luc Boasson:
The Equivalence of pre-NTS Grammars is Decidable.
Mathematical Systems Theory 25(1): 61-74 (1992) |
| 1990 |
|---|
| 39 | | Jean Berstel,
Luc Boasson:
Context-Free Languages.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 59-102 |
| 1989 |
|---|
| 38 | | Jean-Michel Autebert,
Luc Boasson,
Michel Latteux:
Motifs Et Bases De Langages.
ITA 23(4): 379-393 (1989) |
| 1987 |
|---|
| 37 | | Luc Boasson,
Antoine Petit:
Langages Algébriques Déterministes Non Générateurs.
ITA 21(1): 41-57 (1987) |
| 36 | | Jean-Michel Autebert,
Luc Boasson,
Géraud Sénizergues:
Groups and NTS Languages.
J. Comput. Syst. Sci. 35(2): 243-267 (1987) |
| 1985 |
|---|
| 35 | | Luc Boasson,
Antoine Petit:
Deterministic Languages and Non-Generators.
STACS 1985: 39-46 |
| 34 | | Luc Boasson:
Non-Générateurs Algébriques et Substitution.
ITA 19(2): 125-136 (1985) |
| 33 | | Luc Boasson,
Géraud Sénizergues:
NTS Languages Are Deterministic and Congruential.
J. Comput. Syst. Sci. 31(3): 332-342 (1985) |
| 1984 |
|---|
| 32 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson,
Françoise Gire:
Bicentres de langages algébriques.
Acta Inf. 21: 209-227 (1984) |
| 31 | | Jean-Michel Autebert,
Luc Boasson,
Joaquim Gabarró:
Context-free grammars in Greibach normal forms.
Bulletin of the EATCS 24: 44-47 (1984) |
| 30 | | 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) |
| 29 | | 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) |
| 1982 |
|---|
| 28 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson:
Formes de langages et de grammaires.
Acta Inf. 17: 193-213 (1982) |
| 27 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson,
Michel Latteux:
Indécidabilité de la Condition IRS.
ITA 16(2): 129-138 (1982) |
| 1981 |
|---|
| 26 | | Luc Boasson:
Some Applications of CFL's over Infinte Alphabets.
Theoretical Computer Science 1981: 146-151 |
| 25 | | Luc Boasson,
Maurice Nivat:
Centers of Languages.
Theoretical Computer Science 1981: 245-251 |
| 24 | | 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) |
| 23 | | Luc Boasson,
Bruno Courcelle,
Maurice Nivat:
The Rational Index: A Complexity Measure for Languages.
SIAM J. Comput. 10(2): 284-296 (1981) |
| 1980 |
|---|
| 22 | | Luc Boasson:
Derivations et Redutions dans les Grammaires Algebriques.
ICALP 1980: 109-118 |
| 21 | | Luc Boasson,
Maurice Nivat:
Adherences of Languages.
J. Comput. Syst. Sci. 20(3): 285-309 (1980) |
| 1979 |
|---|
| 20 | | Luc Boasson:
Context-Free Sets of Infinite Words.
Theoretical Computer Science 1979: 1-9 |
| 19 | | Luc Boasson:
Un langage algébrique particulier.
ITA 13(3): (1979) |
| 18 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson,
Maurice Nivat:
Quelques problèmes ouverts en théorie des langages algébriques.
ITA 13(4): (1979) |
| 1978 |
|---|
| 17 | | Luc Boasson,
Sándor Horváth:
On languages satisfying Ogden's lemma.
ITA 12(3): (1978) |
| 16 | | Jean-Michel Autebert,
Luc Boasson,
Guy Cousineau:
A Note on 1-Locally Linear Languages
Information and Control 37(1): 1-4 (1978) |
| 1977 |
|---|
| 15 | | Luc Boasson:
Classification of the Context-Free Languages.
MFCS 1977: 34-43 |
| 14 | | Luc Boasson:
Un langage algébrique non-générateur.
Theoretical Computer Science 1977: 145-148 |
| 13 | | Luc Boasson,
Antonio Restivo:
Une Caractérisation des Langages Algébriques Bornés.
ITA 11(3): 203-205 (1977) |
| 12 | | Luc Boasson,
Maurice Nivat:
Le Cylindre des Langages Linéaires.
Mathematical Systems Theory 11: 147-155 (1977) |
| 1976 |
|---|
| 11 | | Luc Boasson,
Maurice Nivat:
Parenthesis Generators
FOCS 1976: 253-257 |
| 10 | | Luc Boasson:
Langages Algebriques, Paires Iterantes et Transductions Rationnelles.
Theor. Comput. Sci. 2(2): 209-223 (1976) |
| 1975 |
|---|
| 9 | | Luc Boasson,
Maurice Nivat:
Le cylindre des langages linéaires n'est pas principal.
Automata Theory and Formal Languages 1975: 16-19 |
| 8 | | Luc Boasson:
on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages.
MFCS 1975: 194-198 |
| 1974 |
|---|
| 7 | | Jean Berstel,
Luc Boasson:
Une suite decroissante de cônes rationnels.
ICALP 1974: 383-397 |
| 1973 |
|---|
| 6 | | Luc Boasson,
Maurice Nivat:
Sur diverses familles de langages fermées par transductions rationelle
Acta Inf. 2: 180-188 (1973) |
| 5 | | Luc Boasson,
J. P. Crestin,
Maurice Nivat:
Familles de langages translatables et fermées par crochet
Acta Inf. 2: 383-393 (1973) |
| 4 | | 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) |
| 3 | | Luc Boasson:
Two Iteration Theorems for Some Families of Languages.
J. Comput. Syst. Sci. 7(6): 583-596 (1973) |
| 1972 |
|---|
| 2 | | Luc Boasson:
Un critère de rationnalité des langages algébriques.
ICALP 1972: 359-365 |
| 1971 |
|---|
| 1 | | Luc Boasson:
An Iteration Theorem for One-Counter Languages
STOC 1971: 116-120 |
