참고문헌
- Intern. J. of Computer Mathematics v.30 The modular grammars A. Atanasiu;V. Mitrana
- Inform. Proces. Lett. v.25 Multiprocessor automata A. O. Buda
- Intern. J. Foundations of Computer Science v.7 Multi-push-down languages and grammars L. Breveglieri;A. Cherubini;C. Citrini;S. Crespi Reghizzi
- J. Comput. System Sci. v.52 A polynomial-time parsing algorithm for k-depth languages A. Cherubini;P. San Pietro
- Journal of ACM v.18 Characterizations of pushdown machines in terms of time - bounded computers S. A. Cook
- J. of Information Processing and Cybernetics (EIK) v.26 On cooperating/distributed grammar systems E. Csuhaj-Varju;J. Dassow;J. Kelemen;Gh. Paun
- Gordon and Breach Grammar Systems. A grammatical approach to distribution and cooperation E. Csuhaj-Varju;J. Dassow;J. Kelemen;Gh. Paun
- submitted Parallel communicating push-down automata systems E. Csuhaj-Varju;C. Martin-Vide;V. Mitrana;G. Vaszil
- J. Comput. System Sci. v.58 Stack cooperation in multi-stack pushdown automata J. Dassow;V. Mitrana
- in The Handbook of AI v.4 Cooperative distributed problem solving E. H. Durfee et all;A. Barr(eds.);P. R. Cohen(eds.);E. A. Feigenbaum(eds.)
- J. of ACM 27 Fixed point languages, equality languages, and representations of recursively enumerable languages J. Engelfriet;G. Rozenberg
- New Generation Computing v.3 Computationally relevant properties of natural languages and their grammars G. Gazdar;G. K. Pullum
- Acta Informatica v.1 On nondeterminancy in simple computing devices J. Hartmanis
- Introduction to Formal Language Theory M. A. Harrison
- J. Comput. System Sci. v.7 One two-way multihead automata O. H. Ibarra
- Inform. Process Lett. v.3 A note on semilinear sets and bounded-reversal multihead pushdown automata O. H. Ibarra
- Computational and Theoretic Perspectives How much context-sensitivity is required to provide reasonable structural descriptions? Tree adjoining grammars. In Natural Language Processing: Psycholinguistic A. K. Joshi;D. R. Dowty et al.(eds.)
- submitted Some undecidable problems for parallel communicating finite automata systems C. Martin-Vide;V. Mitrana
- Mathematical Methods in Linguistics B. H. Partee;A. ter Meulen;R. E. Wahl
- submitted Parallel finite automata systems communicating by states A. Mateescu;V. Mitrana;A. Salomaa
- Ann. Univ. Bucharest, Ser. Matem.-Inform. v.38 Parallel communicating grammar systems: the regular case Gh. Paun;L. Santean
- DNA Computing. New Computing Paradigms G. Paun;G. Rozenberg;A. Salomaa
- The Handbook of Formal Languages G. Rozenberg;A. Salomaa (eds.)
- R.A.I.R.O. Informatique theorique v.11 Some remarks on multihead automata I. H. Sudborough
- Journal of ACM v.25 k+1 heads are better than k A. C. Yao;R. L. Rivest