A note on leftmost restricted random context grammars

https://doi.org/10.1016/0020-0190(73)90008-2Get rights and content

First page preview

First page preview
Click to open first page preview

References (14)

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 Science
    Citation 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.

  • Handbook of mathematical models for languages and computation

    2020, Handbook of Mathematical Models for Languages and Computation
  • Regulated grammars and automata

    2014, Regulated Grammars and Automata
  • One-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)
View all citing articles on Scopus
View full text