String grammars with disconnecting
The complexity of languages generated by context-free grammars with disconnecting is investigated. It is shown that even linear and deterministic context-free languages can generate languages of multisets, the membership problem of which is NP-complete. In contrast to that, this problem is in DSPACE(log n) for regular sets.
Unable to display preview. Download preview PDF.
- [BM]W. Bucher and H. Maurer, Theoretische Grundlagen der Programmier-sprachen — Automaten und Sprachen, BI, Mannheim, Reihe Informatik/41, 1984.Google Scholar
- [HA]M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley Publ., Reading, 1978.Google Scholar
- [HU]J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ., Reading, 1979.Google Scholar
- [Kr]H.-J. Kreowski, A pumping lemma for context-free graph languages, Lecture Notes in Computer Science 73, (1979), 270–283.Google Scholar
- [LW]K.-J. Lange and E. Welzl, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Hamburg 1984, submitted for publication.Google Scholar
- [Pr]T.W. Pratt, Pair grammars, graph languages and string-to-graph translations, J. of Comput. System Sci. 5 (1971), 560–595.Google Scholar
- [RW]G. Rozenberg and E. Welzl, Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Report 84-29, Inst. of Appl. Math. and Comput. Sci., University of Leiden, 1984.Google Scholar
- [R1]K. Ruohonen, Developmental systems with interaction and fragmentation, Information and Control 28 (1975), 91–112.Google Scholar
- [R2]K. Ruohonen, JL systems with non-fragmented axioms: the hierarchy, Internat. J. of Comput. Math. 5 (1975), 143–156.Google Scholar