论文信息 - Economy of Description by Automata, Grammars, and Formal Systems - 字舞流文

Economy of Description by Automata, Grammars, and Formal Systems

A. R. Meyer | M. J. Fischer | A. Meyer | M. J. Fischer

[1] Bruce H. Barnes. A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton , 1971, IEEE Transactions on Computers.

[2] Juris Hartmanis. R70-1 A Note on Computing Time for the Recognition of Context- Free Languages by a Single-Tape Turing Machine , 1970, IEEE Transactions on Computers.

[3] Frederick C. Hennie,et al. Finite-state Models for Logical Machines , 1968 .

[4] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.

[5] Richard Edwin Stearns,et al. A Regularity Test for Pushdown Machines , 1967, Inf. Control..

[6] Manuel Blum. On the Size of Machines , 1967, Inf. Control..

[7] Jean-Claude Boussard. An ALGOL compiler: construction and use in relation to an elaborate operating system , 1966, CACM.

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

[9] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[10] J. M. Foster,et al. Mathematical theory of automata , 1965 .

[11] John C. Shepherdson,et al. The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[12] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[13] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .