论文信息 - Scattered versus context-sensitive rewriting

Scattered versus context-sensitive rewriting

SummaryWe study the relationship between scattered and context-sensitive rewriting. We prove that an extended version of scattered grammars produces exactly the context-sensitive languages. Also unordered scattered context languages are a proper subset of scattered context languages, and unordered scattered rewriting with erasing does not generate all scattered context (and thus not all context-sensitive) languages.

Jakob Gonczarowski | Manfred K. Warmuth

[1] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[2] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[3] Jakob Gonczarowski,et al. Applications of Scheduling Theory to Formal Language Theory , 1985, Theor. Comput. Sci..

[4] Armin B. Cremers. Normal forms for context-sensitive grammars , 2004, Acta Informatica.

[5] Haim Gaifman,et al. Concerning Two-Adjacent Context-Free Languages , 1985, Theor. Comput. Sci..

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

[7] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[8] Jakob Gonczarowski,et al. Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style , 1985, J. Comput. Syst. Sci..

[9] Manfred K. Warmuth,et al. Membership for Growing Context-Sensitive Grammars is Polynomial , 1986, J. Comput. Syst. Sci..

[10] John E. Hopcroft,et al. Scattered Context Grammars , 1969, J. Comput. Syst. Sci..

[11] Grzegorz Rozenberg,et al. Context-Free Like Restrictions on Selective Rewriting , 1981, Theor. Comput. Sci..

[12] Jakob Gonczarowski,et al. Manipulating Derivation Forests by Scheduling Techniques , 1986, Theor. Comput. Sci..

[13] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.