A note on leftmost restricted random context grammars
References (14)
- et al.
Scattered context grammars
J. Comp. Syst. Sci.
(1969) Simple matrix languages
Inform. Contr.
(1970)An hierarchy between context-free and context-sensitive languages
J. Comp. Syst. Sci.
(1970)Some restrictive devices for context-free grammars
Inform. Contr.
(1972)Periodically time-variant context-free grammars
Inform. Contr.
(1970)Matrix grammars with a leftmost restriction
Inform. Contr.
(1972)Some questions of phrase structure grammars
Computational Linguistics
(1965)
There are more references available in the full text version of this article.
Cited by (13)
On some derivation mechanisms and the complexity of their Szilard languages
2014, Theoretical Computer ScienceCitation Excerpt :RCG with context-free rules have been introduced in [43] to cover the gap between the classes of context-free languages and context-sensitive languages. The generative capacity and several descriptional properties of RCGs can be found in [10,18,22,43,44]. A matrix grammar (MG) is a RRG in which rules are grouped into sequences of rules, each sequence defining a matrix.
A variant of random context grammars: Semi-conditional grammars
1985, Theoretical Computer ScienceBinary context-free grammars
2020, SymmetryHandbook of mathematical models for languages and computation
2020, Handbook of Mathematical Models for Languages and ComputationRegulated grammars and automata
2014, Regulated Grammars and AutomataOne-sided random context grammars with leftmost derivations
2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1973 Published by Elsevier B.V.