UNE FORME CANONIQUE POUR LES GRAMMAIRES SIMPLES DETERMINISTESCOURCELLE B.REVUE FRANCAISE D'AUTOMATIQUE. RECHERCHE OPERATIONNELLE ANC REVUE FRANCAISE D'INFORMATIQUE ET DE RECHERCHE OPERATIONNELLE. 1974, Vol 8, pp 19-36Article

FUNDAMENTAL PROPERTIES OF INFINITE TREESCOURCELLE B.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 25; NO 2; PP. 95-169; BIBL. 70 REF.Article

A REPRESENTATION OF TREES BY LANGUAGES IICOURCELLE B.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 1; PP. 25-55; BIBL. 33 REF.Article

AN AXIOMATIC APPROACH TO THE KORENJAK-HOPCROFT ALGORITHMSCOURCELLE B.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 393-407; BIBL. 2 P.Conference Paper

ARBRES INFINIS ET SYSTEMES D'EQUATIONSCOURCELLE B.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 1; PP. 31-48; BIBL. 15 REF.Article

ON THE DEFINITION OF CLASSES OF INTERPRETATIONS.COURCELLE B.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 231; PP. 1-16; ABS. FR.; BIBL. 14 REF.Serial Issue

SUR LES ENSEMBLES ALGEBRIQUES D'ARBRES ET LES LANGAGES DETERMINISTES; QUELQUES APPLICATIONS A LA THEORIE DES SCHEMAS DE PROGRAMME.COURCELLE B.1976; ; S.L.; DA. 1976; PP. (163P.); BIBL. 2 P. 1/2; (THESE DOCT. SPEC. MATH.; PARIS VII)Thesis

ARBRES ALGEBRIQUES ET LANGAGES DETERMINISTES.COURCELLE B.sdIN: THEOR. ALGORITHMES LANG. PROGRAMMATION. SEMIN.; ROCQUENCOURT; 1974-1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 23-27; ABS. ANGL.; BIBL. 4 REF.Conference Paper

ON JUMP-DETERMINISTIC PUSDOWN AUTOMATACOURCELLE B.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 87-109; BIBL. 26 REF.Article

RECURSIVE SCHEMES ALGEBRAIC TREES AND DETERMINISTIC LANGUAGES.COURCELLE B.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 78; PP. 1-11; ABS. FR.; BIBL. 12 REF.Article

ON RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTION.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 285; PP. 1-55; ABS. FR.; BIBL. 2 P.Serial Issue

UNE FORME CANONIQUE POUR LES GRAMMAIRES SIMPLES DETERMINISTES.COURCELLE B.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 19-36; ABS. ANGL.; BIBL. 3 REF.Article

FRONTIERS OF INFINITE TREES.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 272; PP. 1-26; ABS. FR.; BIBL. 6 REF.Serial Issue

ARBRES INFINIS ET SYSTEMES D'EQUATIONSCOURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1978; NO 328; PP. 1-26; ABS. ENG; BIBL. 15 REF.Serial Issue

AN AXIOMATIC APPROACH TO THE KORENJAK-HOPCROFT ALGORITHMSCOURCELLE B.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 3; PP. 191-231; BIBL. 21 REF.Article

THE SIMULTANEOUS ACCESSIBILITY OF TWO CONFIGURATIONS OF TWO EQUIVALENT DPDA'SCOURCELLE B.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 3; PP. 111-114; BIBL. 8 REF.Article

ATTRIBUTE GRAMMARS: THEORY AND APPLICATIONSCOURCELLE B.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 75-95; BIBL. 29 REF.Conference Paper

INFINITE TREES IN NORMAL FORM AND RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTIONCOURCELLE B.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 131-180; BIBL. 36 REF.Article

REDUCTIONS OPTIMALESCOURCELLE B.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 131-156; BIBL. 5 REF.Conference Paper

FRONTIERS OF INFINITE TREESCOURCELLE B.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 319-337; BIBL. 8 REF.Article

SUR LA TRADUCTION DES SCHEMAS RECURSIFS MONADIQUES EN SCHEMAS ITERATIFS.COURCELLE B.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 69; PP. 1-35; ABS. ANGL.; BIBL. 1 P. 1/2Article

The monadic second-order logic of graphs. XIII : Graph drawings with edge crossingsCOURCELLE, B.Theoretical computer science. 2000, Vol 244, Num 1-2, pp 63-94, issn 0304-3975Article

Monadic second-order definable graph transductions: a surveyCOURCELLE, B.Theoretical computer science. 1994, Vol 126, Num 1, pp 53-75, issn 0304-3975Conference Paper

Some negative results concerning DPDÁsCOURCELLE, B.Information processing letters. 1984, Vol 18, Num 5, pp 285-289, issn 0020-0190Article

The monadic second-order logic of graphs. XII : planar graphs and planar mapsCOURCELLE, B.Theoretical computer science. 2000, Vol 237, Num 1-2, pp 1-32, issn 0304-3975Article