Unconditional transfer in regulated rewriting

Acta Informatica

Volumn 34, Issue 11, 1997, Pages 837-857

  Fernau, Henning ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; PROBLEM SOLVING;

REGULATED REWRITING; UNCONDITIONAL TRANSFER;

FORMAL LANGUAGES;

EID: 0031275158     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050108     Document Type: Article

References (30)

1. S. Ábrahám: Some questions of phrase-structure grammars. Comput. Linguistics, 4:61-70 (1965)
2. A. Atanasiu, V. Mitrana: The modular grammars. International Journal of Computer Mathematics, 30:101-122 (1989)
3. E. Csuhaj-Varjú et al: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. London: Gordon and Breach, 1994
4. J. Dassow: A remark on limited 0L systems. J. Inf. Process. Cybern. EIK, 24(6):287-291 (1988)
5. J. Dassow, R. Freund: A general framework for regulated rwriting. Manuscript, 1996
6. J. Dassow, Gh. Pǎun: Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Berlin, Heidelberg, New York: Springer, 1989
7. H. Fernau: On function-limited Lindenmayer systems. J. Inf. Process. Cybern. EIK, 27(1):21-53 (1991)
8. H. Fernau: Membership for 1-limited ET0L languages is not decidable. J. Inf. Process. Cybern. EIK, 30(4):191-211 (1994)
9. H. Fernau: A predicate for separating language classes. EATCS Bulletin, 56:96-97, June 1995
10. H. Fernau: On grammar and language families. Fundamenta Informaticae, 25(1):17-34 (1996)
11. H. Fernau: On unconditional transfer. In W. Penczek and A. Szałas, editors, MFCS'96, volume 1113 of LNCS, pages 348-359. Berlin, Heidelberg, New York: Springer 1996
12. H. Fernau: Scattered context grammars with regulation. Ann. Univ. Bucharest, Math.-Informatics Series, 45(1):41-50 (1996)
13. H. Fernau, H. Bordihn: Remarks on accepting parallel systems. International Journal of Computer Mathematics, 56:51-67 (1995)
14. H. Fernau, D. Wätjen: Remarks on regulated limited ET0L systems and regulated context-free grammars. Technical Report WSI-96-19, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1996. Accepted for publication in Theoretical Computer Science
15. S. Ginsburg, E. H. Spanier: Control sets on grammars. Mathematical Systems Theory, 2:159-177 (1968)
16. D. Hauschildt, M. Jantzen: Petri net algorithms in the theory of matrix grammars. Acta Inf. 31:719-728 (1994)
17. F. Hinz, J. Dassow: An undecidability result for regular languages and its application to regulated rewriting. EATCS Bulletin, 38:168-173 (1989)
18. J. Karhumäki, M. Linna: A note on morphic characterization of languages. Discrete Applied Mathematics, 5:243-246 (1983)
19. A. Pascu, Gh. Pǎun: On the planarity of bicolored digraph grammar systems. Discrete Mathematics, 25:195-197 (1979)
20. Gh. Pǎun: Normal forms for bicolored-digraph-grammar systems. International Journal of Computer Mathematics, 7:109-118 (1979)
21. D. J. Rosenkrantz: Programmed grammars and classes of formal languages. Journal of the Association for Computing Machinery, 16(1):107-131 (1969)
22. G. Rozenberg, A. K. Salomaa: Context-free grammars with graph-controlled tables. Technical Report DAIMI PB-43, Institute of Mathematics at the University of Aarhus, Ny Munkegade, DAN-8000 Aarhus C, January 1975
23. A. K. Salomaa: On grammars with restricted use of productions. Annales academiae scientarum Fennicae, Serie A-454:1-32 (1969)
24. A. K. Salomaa: Periodically time-variant context-free grammars. Information and Control, 17:294-311 (1970)
25. A. K. Salomaa: Formal Languages. New York: Academic Press, 1973
26. D. Wätjen: k-limited 0L systems and languages. J. Inf. Process. Cybern. EIK, 24(6):267-285 (1988)
27. D. Wätjen, E. Unruh: On extended k-uniformly-limited T0L systems and languages. J. Inf. Process. Cybern. EIK, 26(5/6):283-299 (1990)
28. D. Wood: Bicolored digraph grammar systems. RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications, 1:45-50 (1973)
29. D. Wood: A note on bicolored digraph grammar systems. International Journal of Computer Mathematics, 3:301-308 (1973)