The WHILE Hierarchy of Program Schemes Is Infinite
暂无分享,去创建一个
[1] David C. Luckham,et al. On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..
[2] Corrado Böhm,et al. Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.
[3] Arto Salomaa. Jewels of formal language theory , 1981 .
[4] Iu. I. Ianov,et al. On the equivalence and transformation of program schemes , 1958, CACM.
[5] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .
[6] Iu. I. Ianov,et al. On matrix program schemes , 1958, CACM.
[7] David Gries,et al. Program Schemes with Pushdown Stores , 1972, SIAM J. Comput..
[8] J. Karhumäki,et al. Arto Salomaa , 1999 .
[9] Carl Hewitt,et al. Comparative Schematology , 1970 .
[10] Joseph D. Rutledge. On Ianov's Program Schemata , 1964, JACM.
[11] Marcel Paul Schützenberger,et al. On a Question of Eggan , 1966, Inf. Control..
[12] S. Kleene. General recursive functions of natural numbers , 1936 .
[13] Janusz A. Brzozowski,et al. General Properties of Star Height of Regular Events , 1970, J. Comput. Syst. Sci..
[14] John J. Cannon. Computers in group theory: a survey , 1969, CACM.