Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples

[1]  Amir Pnueli,et al.  A Direct Algorithm for Checking Equivalence of LL(k) Grammars , 1977, Theor. Comput. Sci..

[2]  Bruno Courcelle,et al.  Completeness Results for the Equivalence of Recursive Schemas , 1976, J. Comput. Syst. Sci..

[3]  Irène Guessarian,et al.  Algebraic semantics , 1981, Lecture Notes in Computer Science.

[4]  Amiram Yehudai,et al.  On Equivalence of Grammars Through Transformation Trees , 1979, Theor. Comput. Sci..

[5]  Maurice Nivat,et al.  Mots Infinis Engendrés par Une Grammaire Algébrique , 1977, RAIRO Theor. Informatics Appl..

[6]  Maurice Nivat,et al.  Langages algébriques sur le magma libre et sémantique des schémas de programme , 1972, ICALP.

[7]  Maurice Nivat,et al.  Sur les ensembles de mots infins engendrés par une grammaire algébrique , 1978, RAIRO Theor. Informatics Appl..

[8]  Stephen J. Garland,et al.  Program Schemes, Recursion Schemes, and Formal Languages , 1973, J. Comput. Syst. Sci..

[9]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[10]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1966, Inf. Control..

[11]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[12]  Emily P. Friedman,et al.  Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes , 1977, J. Comput. Syst. Sci..

[13]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[14]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[15]  Etsuji Tomita.  An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata , 1984, Theor. Comput. Sci..

[16]  Maurice Nivat,et al.  Adherences of Languages , 1980, J. Comput. Syst. Sci..