Tree Generating Regular Systems
暂无分享,去创建一个
[1] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[3] Saul Corn,et al. Explicit Definitions and Linguistic Dominoes , 1967 .
[4] John Doner,et al. Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..
[5] Noam Chomsky,et al. On Certain Formal Properties of Grammars , 1959, Inf. Control..
[6] Walter Scott Brainerd,et al. TREE GENERATING SYSTEMS AND TREE AUTOMATA , 1967 .
[7] J. R. Büchi. Regular Canonical Systems , 1964 .
[8] Walter S. Brainerd,et al. The Minimalization of Tree Automata , 1968, Inf. Control..
[9] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .