ON RATIONAL EXPRESSIONS REPRESENTING INFINITE RATIONAL TREES: APPLICATION TO THE STRUCTURE OF FLOW CHARTSCOUSINEAU G; NIVAT M.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 567-580; BIBL. 23 REF.Conference Paper

The solutions of two star-height problems for regular treesBRAQUELAIRE, J. P; COURCELLE, B; NIVAT, M et al.Theoretical computer science. 1984, Vol 30, Num 2, pp 205-239, issn 0304-3975Article

ALGORITHMIQUES PARALLELE ET SEQUENTIELLE DES AUTOMATES = PARALLEL AND SEQUENTIAL ALGORITHMS FOR AUTOMATAZiadi Djelloul, Djell; Champarnaud, Jean-Marc.1996, 117 p.Thesis

A DIRECT APPROACH TO THE PARALLEL EVALUATION OF RATIONAL EXPRESSIONS WITH A SMALL NUMBER OF PROCESSORS.SNIR M; BARAK AB.1977; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1977; VOL. 26; NO 10; PP. 933-937; BIBL. 6 REF.Article

Derivation of rational expressions with multiplicityLOMBARDY, Sylvain; SAKAROVITCH, Jacques.Lecture notes in computer science. 2002, pp 471-482, issn 0302-9743, isbn 3-540-44040-2, 12 p.Conference Paper

Algorithmique et implémentation des automates Contribution au développement du logiciel AUTOMATE = Algorithmics and implementation of automata Contribution to the development of the AUTOMATE softwarePonty, Jean-Luc; Champarnaud, Jean-Marc.1997, 126 p.Thesis

From regular expressions to deterministic automataBERRY, G; SETHI, R.Theoretical computer science. 1986, Vol 48, Num 1, pp 117-126, issn 0304-3975Article

Distance desert automata and the star height problemKIRSTEN, Daniel.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 3, pp 455-509, issn 0988-3754, 55 p.Conference Paper

Derivatives of rational expressions and related theoremsCHAMPAMAUD, Jean-Marc; DUCHAMP, Gérard.Theoretical computer science. 2004, Vol 313, Num 1, pp 31-44, issn 0304-3975, 14 p.Conference Paper

Series-parallel languages on scattered and countable posetsBEDON, Nicolas; RISPAL, Chloé.Theoretical computer science. 2011, Vol 412, Num 22, pp 2356-2369, issn 0304-3975, 14 p.Article

How expressions can code for automataLOMBARDY, Sylvain; SAKAROVITCH, Jacques.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 217-237, issn 0988-3754, 21 p.Article

Visibly rational expressionsBOZZELLI, Laura; SANCHEZ, César.Acta informatica. 2014, Vol 51, Num 1, pp 25-49, issn 0001-5903, 25 p.Article

CONSTRUCTION OF TREE AUTOMATA FROM REGULAR EXPRESSIONSKUSKE, Dietrich; MEINECKE, Ingmar.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 3, pp 347-370, issn 0988-3754, 24 p.Article

CORRIGENDUM TO OUR PAPER: HOW EXPRESSIONS CAN CODE FOR AUTOMATALOMBARDY, Sylvain; SAKAROVITCH, Jacques.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 3, pp 339-361, issn 0988-3754, 23 p.Article

Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoidsBERSTEL, Jean; REUTENAUER, Christophe.Theoretical computer science. 2008, Vol 400, Num 1-3, pp 144-158, issn 0304-3975, 15 p.Article

Derivatives of rational expressions with multiplicityLOMBARDY, Sylvain; SAKAROVITCH, Jacques.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 141-177, issn 0304-3975, 37 p.Article