Preservation of Languages by Transducers
暂无分享,去创建一个
[1] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.
[2] Peter S. Landweber,et al. Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..
[3] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[4] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..
[5] Seymour Ginsburg,et al. Some Recursively Unsolvable Problems in ALGOL-Like Languages , 1963, JACM.
[6] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[7] Seymour Ginsburg,et al. Solvability of Machine Mappings of Regular Sets to Regular Sets , 1964, JACM.
[8] Seymour Ginsburg,et al. Two Families of Languages Related to ALGOL , 1962, JACM.
[9] Noam Chomsky,et al. On Certain Formal Properties of Grammars , 1959, Inf. Control..