Formal languages
Automata and languages: theory and applications
Automata and languages: theory and applications
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
A Grammatical Approach to the LBA Problem
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Nonterminal complexity of programmed grammars
Theoretical Computer Science
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
Journal of Automata, Languages and Combinatorics
Erasing in Petri Net Languages and Matrix Grammars
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
On erasing productions in random context grammars
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Handbook of Formal Languages: Volume 2. Linear Modeling Background and Application
Handbook of Formal Languages: Volume 2. Linear Modeling Background and Application
| Hi-index | 5.23 |
This paper establishes a workspace theorem in terms of regular-controlled (context-free) grammars. It proves that, if, for a regular-controlled grammar H, there is a positive integer k such that H generates every sentence y@?L(H) by a derivation in which every sentential form x contains at most (k-1)|x|/k occurrences of nonterminals that are erased throughout the rest of the derivation, where |x| denotes the length of x, then the language of H is generated by a propagating regular-controlled grammar. An analogical workspace theorem is demonstrated for regular-controlled grammars with appearance checking. The paper provides an algorithm that removes all erasing rules from any regular-controlled grammar (possibly with appearance checking) that satisfies the workspace condition above without affecting the generated language. In its conclusion, the paper points out a relationship of the workspace theorems to other areas of formal language theory.