TRANSDUCTIONS ET FAMILLES DE LANGAGESBOASSON L; NIVAT M.MATH. SCI. HUM. 1971, Vol 9, Num 35, pp 31-37Article

UN LANGAGE ALGEBRIQUE PARTICULIERBOASSON L.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 203-215; ABS. ENG; BIBL. 12 REF.Article

DERIVATIONS ET REDUCTIONS DANS LES GRAMMAIRES ALGEBRIQUESBOASSON L.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 109-118; BIBL. 21 REF.Conference Paper

LANGAGES ALGEBRIQUES, PAIRES ITERANTES ET TRANSDUCTIONS RATIONNELLES.BOASSON L.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 2; PP. 209-223; ABS. ANGL.; BIBL. 12 REF.Article

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.BOASSON L.1973; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1973; VOL. 2; NO 5; PP. 135-139; BIBL. 11 REF.Article

SOME APPLICATIONS OF CFL'S OVER INFINITE ALPHABETSBOASSON L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 146-151; ABS. ENG; BIBL. 9 REF.Conference Paper

Non-générateurs algébriques et substitution = Algebric non generators and substitutionBOASSON, L.R.A.I.R.O. Informatique théorique. 1985, Vol 19, Num 2, pp 125-136, issn 0399-0540Article

ORDRES ET TYPES DE LANGAGES.BOASSON L; NIVAT M.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 284; NO 11; PP. 625-628; ABS. ANGL.; BIBL. 2 REF.Article

ORDRES ET TYPES DE LANGAGES.BOASSON L; NIVAT M.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 284; NO 12; PP. 702-705; ABS. ANGL.; BIBL. 3 REF.Article

UNE CARACTERISATION DES LANGAGES ALGEBRIQUES BORNES.BOASSON L; RESTIVO A.1977; R.A.I.R.O. INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 3; PP. 203-205; BIBL. 4 REF.Article

CENTERS OF LANGUAGESBOASSON L; NIVAT M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 245-251; BIBL. 8 REF.Conference Paper

ON LANGUAGES SATISFYING OGDEN'S LEMMABOASSON L; HORVATH S.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 201-202; BIBL. 7 REF.Article

CONTRIBUTION A L'ETUDE DES CONES MINIMAUXAUTEBER JM; BEAUQUIER J; BOASSON L et al.1978; C.R. ACAD. SCI., A; FRA; DA. 1978; VOL. 287; NO 5; PP. 353-355; ABS. ENG; BIBL. 4 REF.Article

A NOTE ON 1-LOCALLY LINEAR LANGUAGES.AUTEBERT JM; BOASSON L; COUSINEAU G et al.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 1; PP. 1-4; BIBL. 2 REF.Article

THE RATIONAL INDEX: A COMPLEXITY MEASURE FOR LANGUAGESBOASSON L; COURCELLE B; NIVAT M et al.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 284-296; BIBL. 10 REF.Article

LIMITES DE LANGAGES ALGEBRIQUESAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1980; C.R. HEBD. SEANCES ACAD. SCI., SER. A; ISSN 0302-8429; FRA; DA. 1980; VOL. 291; NO 9; PP. 555-558; ABS. ENG; BIBL. 4 REF.Article

A NEW COMPLEXITY MEASURE FOR LANGUAGES.BOASSON L; COURCELLE B; NIWAT M et al.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 255; PP. 1-10; ABS. FR.; BIBL. 6 REF.Serial Issue

Langages algébriques déterministes non générateurs = Deterministic and non generating context-free languagesBOASSON, L; PETIT, A.Informatique théorique et applications (Imprimé). 1987, Vol 21, Num 1, pp 41-57, issn 0988-3754Article

SUR LA DECIDABILITE DE CERTAINES QUESTIONS LIEES A LA LINEARITE DES LANGAGESAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1979; C.R. ACAD. SCI., A.; FRA; DA. 1979; VOL. 288; NO 19; PP. 925-927; ABS. ENG; BIBL. 4 REF.Article

The equivalence of Pre-NTS grammars Is decidableAUTEBERT, J.-M; BOASSON, L.Mathematical systems theory. 1992, Vol 25, Num 1, pp 61-74, issn 0025-5661Article

NTS language are deterministic and congruentialBOASSON, L; SENIZERGUES, G.Journal of computer and system sciences (Print). 1985, Vol 31, Num 3, pp 332-342, issn 0022-0000Article

INDECIDABILITE DE LA CONDITION IRSAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 2; PP. 129-138; ABS. ENG; BIBL. 14 REF.Article

XML grammarsBERSTEL, J; BOASSON, L.Lecture notes in computer science. 2000, pp 182-191, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Partial words and a theorem of Fine and WilfBERSTEL, J; BOASSON, L.Theoretical computer science. 1999, Vol 218, Num 1, pp 135-141, issn 0304-3975Conference Paper

L'informatique au lycéeAUTEBERT, J. M; BEAUQUIER, J; BOASSON, L et al.1980, 105 p.Book