Luc Boasson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 68 from 68

2021

Minimisation of automataJean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. In Jean-Éric Pin, editor, Handbook of Automata Theory. pages 337-373, European Mathematical Society Publishing House, Zürich, Switzerland, 2021. [doi]

2020

Transfinite Lyndon wordsOlivier Carton, Luc Boasson. lmcs, 16(4), 2020. [doi]

2015

Rational Selecting Relations and SelectorsLuc Boasson, Olivier Carton. LATA 2015: 716-726 [doi]

Transfinite Lyndon WordsLuc Boasson, Olivier Carton. dlt 2015: 179-190 [doi]

2014

Splicing Systems from Past to Future: Old and New ChallengesLuc Boasson, Paola Bonizzoni, Clelia de Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza. BIRTHDAY 2014: 51-76

2012

Splicing systems and the Chomsky hierarchyJean Berstel, Luc Boasson, Isabelle Fagnot. TCS, 436:2-22, 2012. [doi]

2010

Sturmian TreesJean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. mst, 46(3):443-478, 2010. [doi]

The expressive power of the shuffle productJean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo. iandc, 208(11):1258-1272, 2010. [doi]

2009

Continuant polynomials and worst-case behavior of Hopcroft s minimization algorithmJean Berstel, Luc Boasson, Olivier Carton. TCS, 410(30-32):2811-2822, 2009. [doi]

2007

A First Investigation of Sturmian TreesJean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. STACS 2007: 73-84 [doi]

2006

Operations preserving regular languagesJean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin. TCS, 354(3):405-420, 2006. [doi]

2005

Mixed languagesJean Berstel, Luc Boasson, Michel Latteux. TCS, 332(1-3):179-198, 2005. [doi]

2003

Operations Preserving Recognizable LanguagesJean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin. fct 2003: 343-354 [doi]

2002

Formal properties of XML grammars and languagesJean Berstel, Luc Boasson. ACTA, 38(9):649-671, 2002. [doi]

Balanced Grammars and Their LanguagesJean Berstel, Luc Boasson. BIRTHDAY 2002: 3-25 [doi]

Shuffle factorization is uniqueJean Berstel, Luc Boasson. TCS, 273(1-2):47-67, 2002. [doi]

2001

Effective Lossy Queue LanguagesParosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani. icalp 2001: 639-651 [doi]

Window-accumulated subsequence matching problem is linearLuc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich. APAL, 113(1-3):59-80, 2001.

2000

XML GrammarsJean Berstel, Luc Boasson. mfcs 2000: 182-191 [doi]

1999

Partial Words and a Theorem of Fine and WilfJean Berstel, Luc Boasson. TCS, 218(1):135-141, 1999. [doi]

A Note on List LanguagesJean Berstel, Luc Boasson. ijac, 9(3-4):263-270, 1999. [doi]

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

1997

The set of Lyndon words is not context-freeJean Berstel, Luc Boasson. eatcs, 63, 1997.

The Set of Minimal Words of a Context-Free Language is Context-FreeJean Berstel, Luc Boasson. jcss, 55(3):477-488, 1997.

1996

Towards an Algebraic Theory of Context-Free LanguagesJean Berstel, Luc Boasson. FUIN, 25(3):217-239, 1996.

1992

The Equivalence of pre-NTS Grammars is DecidableJean-Michel Autebert, Luc Boasson. mst, 25(1):61-74, 1992.

1990

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

1989

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

1987

Groups and NTS LanguagesJean-Michel Autebert, Luc Boasson, Géraud Sénizergues. jcss, 35(2):243-267, 1987.

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

1985

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

NTS Languages Are Deterministic and CongruentialLuc Boasson, Géraud Sénizergues. jcss, 31(3):332-342, 1985.

Non-Générateurs Algébriques et SubstitutionLuc Boasson. ita, 19(2):125-136, 1985.

1984

1982

Formes de langages et de grammairesJean-Michel Autebert, Joffroy Beauquier, Luc Boasson. ACTA, 17:193-213, 1982.

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

1981

Languages albébriques dominés par des langages unairesJean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux. iandc, 48(1):49-53, January 1981.

The Rational Index: A Complexity Measure for LanguagesLuc Boasson, Bruno Courcelle, Maurice Nivat. SICOMP, 10(2):284-296, 1981.

Centers of LanguagesLuc Boasson, Maurice Nivat. tcs 1981: 245-251

Some Applications of CFL s over Infinte AlphabetsLuc Boasson. tcs 1981: 146-151

1980

Langages sur des alphabets infinisJean-Michel Autebert, Joffroy Beauquier, Luc Boasson. DAM, 2(1):1-20, 1980. [doi]

Derivations et Redutions dans les Grammaires AlgebriquesLuc Boasson. icalp 1980: 109-118

Adherences of LanguagesLuc Boasson, Maurice Nivat. jcss, 20(3):285-309, 1980.

1979

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

Context-Free Sets of Infinite WordsLuc Boasson. tcs 1979: 1-9

Un langage algébrique particulierLuc Boasson. ita, 13(3):203-215, 1979.

1978

A Note on 1-Locally Linear LanguagesJean-Michel Autebert, Luc Boasson, Guy Cousineau. iandc, 37(1):1-4, April 1978.

On languages satisfying Ogden s lemmaLuc Boasson, Sándor Horváth. ita, 12(3):201-202, 1978.

1977

Le Cylindre des Langages LinéairesLuc Boasson, Maurice Nivat. mst, 11:147-155, 1977.

Classification of the Context-Free LanguagesLuc Boasson. mfcs 1977: 34-43

Un langage algébrique non-générateurLuc Boasson. tcs 1977: 145-148

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

1976

Parenthesis GeneratorsLuc Boasson, Maurice Nivat. focs 1976: 253-257

Langages Algebriques, Paires Iterantes et Transductions RationnellesLuc Boasson. TCS, 2(2):209-223, 1976.

1975

Le cylindre des langages linéaires n est pas principalLuc Boasson, Maurice Nivat. automata 1975: 16-19

on the Largest Full Sub-AFL of the Full AFL of Context-Free LanguagesLuc Boasson. mfcs 1975: 194-198

1974

Une suite decroissante de cônes rationnelsJean Berstel, Luc Boasson. icalp 1974: 383-397

Paires iterantes et langages algebriquesLuc Boasson. PhD thesis, Univ. Paris VII, 1974.

1973

Familles de langages translatables et fermées par crochetLuc Boasson, J. P. Crestin, Maurice Nivat. ACTA, 2:383-393, 1973.

Sur diverses familles de langages fermées par transductions rationelleLuc Boasson, Maurice Nivat. ACTA, 2:180-188, 1973.

Two Iteration Theorems for Some Families of LanguagesLuc Boasson. jcss, 7(6):583-596, 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 ProperLuc Boasson. ipl, 2(5):135-140, 1973.

1972

Un critère de rationnalité des langages algébriquesLuc Boasson. icalp 1972: 359-365

1971

An Iteration Theorem for One-Counter LanguagesLuc Boasson. stoc 1971: 116-120

Cones rationnels et familles agreables de langages - application au langage a compteurLuc Boasson. PhD thesis, Univ. Paris VII, 1971.

Sign in or sign up to see more results.

runs on WebDSL