Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes

Presentation de trois problemes de decision naturels: un pour les problemes de correspondance et de grammaires CF lineaires, un pour les grammaires CF arbitraires et le dernier pour les schemas de programmes. Chacun de ces 3 problemes de decision, bien que decidable, est montre etre d'une complicite non recursive

[1]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[2]  Thomas G. Szymanski,et al.  Noncanonical Extensions of Bottom-Up Parsing Techniques , 1976, SIAM J. Comput..

[3]  Zohar Manna,et al.  Synchronous schemes and their decision problems , 1980, POPL '80.

[4]  Harry R. Lewis,et al.  Program Schemata and the First-Order Decision Problem , 1974, J. Comput. Syst. Sci..

[5]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[6]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[7]  Jim Gray,et al.  On the Covering and Reduction Problems for Context-Free Grammars , 1972, JACM.

[8]  M. Dennis Mickunas,et al.  On the Complete Covering Problem for LR(k)Grammars , 1976, J. ACM.

[9]  David C. Luckham,et al.  On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..

[10]  Stephen H. Unger,et al.  Structural Equivalence of Context-Free Grammars , 1968, J. Comput. Syst. Sci..

[11]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[12]  Leslie G. Valiant,et al.  A Note on the Succinctness of Descriptions of Deterministic Languages , 1976, Inf. Control..

[13]  Ivan M. Havel,et al.  Real-Time Strict Deterministic Languages , 1972, SIAM J. Comput..

[14]  R. L. Goodstein,et al.  Theory of Recursive Functions and Effective Computability , 1969 .

[15]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[16]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[19]  Karel Culik,et al.  LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[20]  Harry B. Hunt,et al.  On the Decidability of Grammar Problems , 1982, JACM.

[21]  S. Rao Kosaraju.  Analysis of Structured Programs , 1974, J. Comput. Syst. Sci..