Muhitape AFA SHEILA GREIBACH University of California at Los Angeles , Los Angeles , California * AND
暂无分享,去创建一个
[1] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.
[2] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1967, JACM.
[3] Seymour Ginsburg,et al. Studies In Abstract Families Of Languages , 1969 .
[4] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.
[5] Jeffrey D. Ullman,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.
[6] Seymour Ginsburg,et al. One-way nondeterministic real-time list-storage languages , 1968, JACM.
[7] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .
[8] Seymour Ginsburg,et al. Substitution in families of languages , 1970, Inf. Sci..
[9] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..
[10] Mary Katherine Yntema,et al. Inclusion Relations Among Families Of Context-Free Languages , 1967, Inf. Control..
[11] Juris Hartmanis,et al. What makes Some Language Theory Problems Undecidable , 1970, J. Comput. Syst. Sci..
[12] Alfred V. Aho,et al. Nested Stack Automata , 1969, Journal of the ACM.
[13] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .
[14] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .
[15] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.
[16] Seymour Ginsburg,et al. Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..
[17] Journal of the Association for Computing Machinery , 1961, Nature.
[18] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.
[19] Patrick C. Fischer,et al. Turing Machines with Restricted Memory Access , 1966, Inf. Control..
[20] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .