Descriptional complexity of multi-continuous grammars
Acta Cybernetica
Automata and languages: theory and applications
Automata and languages: theory and applications
Homogeneous grammars with a reduced number of non-context-free productions
Information Processing Letters
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Grammars with Context Dependency Restricted to Synchronization
Mathematical Foundations of Computer Science 1986
Context-Free-Like Forms for the Phrase-Structure Grammars
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Hi-index | 0.00 |
This paper deals with selective substitution grammars. It concentrates on multisequential grammars with homogeneous selectors that have all their activated parts identical. The present paper reduces the number and size of selectors in these grammars. Indeed, it demonstrates that for every phrase-structure grammar, there exists an equivalent multisequential grammar having two homogeneous selectors, either of which has only two activated parts.