Space-bounded complexity classes and iterated deterministic substitution

Information and Control - Tập 44 - Trang 282-299 - 1980
Peter R.J. Asveld1
1Mathematical Centre, Tweede Boerhaavestraat 49, 1091 AL Amsterdam, The Netherlands

Tài liệu tham khảo

Asveld, 1977, Controlled iteration grammars and full hyper-AFL's, Inform. Contr., 34, 248, 10.1016/S0019-9958(77)90308-4 Asveld, 1978, Iterated Context-Independent RewritingAn Algebraic Approach to Families of Languages Asveld, 1977, Iterated deterministic substitution, Acta Informatica, 8, 285, 10.1007/BF00264471 Asveld, 1979, Extended linear macro grammars, iteration grammars, and register programs, Acta Inforinatica, 11, 259, 10.1007/BF00289071 Asveld, 1975, Infinite Chains of Hyper-AFL's Baker, 1974, Reversal-bounded multipushdown machines, J. Comput. System Sci., 8, 315, 10.1016/S0022-0000(74)80027-9 Book, 1972, On languages accepted in polynomial time, SIAM J. Computing, 1, 281, 10.1137/0201019 Book, 1970, Time- and tape-bounded Turing acceptors and AFL's, J. Comput. System Sci., 4, 606, 10.1016/S0022-0000(70)80031-9 Downey, 1974, Developmental systems and recursion schemes, 54 Engelfriet, 1978, Three Hierarchies of Transducers Erni, 1977, Auxiliary Pushdown Acceptors and Regulated Rewriting Systems Ginsburg, 1975 Ginsburg, 1969, Studies in Abstract Families of Languages, 10.1090/memo/0087 Ginsburg, 1969, 41 Greibach, 1977, A note on NSPACE (log2 n) and substitution, Rev. Franaise Automat. Informat. Recherche Oprationelle, Sr. Rouge, Informat. Thor., 11, 127 Harju, 1977, A polynomial recognition algorithm for the EDTOL languages, Elektron. Informationsverarbeit. Kybernetik, 13, 169 Herman, 1975 Hopcroft, 1969 Jones, 1977, Recognition of deterministic ETOL languages in logarithmic space, Inform. Contr., 35, 177, 10.1016/S0019-9958(77)90058-4 King, 1978, Stack languages and log n space, J. Comput. System Sci., 17, 281, 10.1016/0022-0000(78)90010-7 Ritchie, 1972, Language recognition by marking automata, Inform. Contr., 20, 313, 10.1016/S0019-9958(72)90205-7 Rounds, 1973, Complexity of recognition in intermediate-level languages, 145 Rozenberg, 1973, Extensions of tabled OL-systems and languages, Internat. J. Comput. Inform. Sci., 2, 311, 10.1007/BF00985664 Salomaa, 1973, Macros, Iterated Substitution and Lindenmayer AFL's Salomaa, 1973, Macros, Iterated Substitution and Lindenmayer AFL's, 250 Sudborough, 1977, The time and tape complexity of developmental languages, 509 Van Leeuwen, 1973 Van Leeuwen, 1975, Extremal properties of non-deterministic time-complexity classes, 61 Van Leeuwen, 1976, A study of complexity in hyper-algebraic families, 323 Wood, 1976, Iterated a-NGSM maps and γ systems, Inform. Contr., 32, 1, 10.1016/S0019-9958(76)90074-7