Elementary formal systems and formal languages-simple formal systems

[1]  W. V. Quine,et al.  Concatenation as a basis for arithmetic , 1946, Journal of Symbolic Logic.

[2]  Seymour Ginsburg,et al.  Some Recursively Unsolvable Problems in ALGOL-Like Languages , 1963, JACM.

[3]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

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

[5]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[6]  Noam Chomsky,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[7]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[8]  S. Arikawa.  ON SOME PROPERTIES OF LENGTH-GROWING FUNCTIONS ON TWO-WAY PUSHDOWN AUTOMATA , 1968 .

[9]  Seymour Ginsburg,et al.  Stack automata and compiling , 1967, JACM.

[10]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[11]  Hans Hermes,et al.  Enumerability, decidability, computability , 1966 .

[12]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[13]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[14]  R. Smullyan.  Theory of formal systems , 1962 .

[15]  ON THE LENGTH FUNCTIONS OF LANGUAGES RECOGNIZABLE BY LINEAR BOUNDED AUTOMATA , 1969 .

[16]  Oscar H. Ibarra,et al.  Two-Way Pushdown Automata , 1967, Inf. Control..