论文信息 - String grammars with disconnecting

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.

Klaus-Jörn Lange | Emo Welzl

[1] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[2] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[4] Keijo Ruohonen. Developmental Systems with Interaction and Fragmentation , 1975, Inf. Control..

[5] Hans-Jörg Kreowski. A Pumping Lemma for Context-Free Graph Languages , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[6] Terrence W. Pratt,et al. Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[7] Grzegorz Rozenberg,et al. Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

[8] K. Ruohonen. JL systems with non-fragmented axioms: The hierarchy , 1975 .