Matrix grammars with a leftmost restriction
From MaRDI portal
Publication:5652215
DOI10.1016/S0019-9958(72)90332-4zbMATH Open0241.68033MaRDI QIDQ5652215FDOQ5652215
Authors: Arto Salomaa 
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Cited In (16)
- A note on leftmost restricted random context grammars
- On the complexity of Szilard languages of regulated grammars
- Classes of formal grammars
- On the leftmost derviation in matrix grammars
- Normal forms for context-sensitive grammars
- The complexity of the membership problem for some extensions of context-free languagest†
- On some derivation mechanisms and the complexity of their Szilard languages
- On state-alternating context-free grammars
- State grammars with stores
- Upper bounds on recognition of a hierarchy of non-context-free languages
- Size, index, and context-sensitivity of controlled partition grammars
- Context-free grammars with graph-controlled tables
- On the computational completeness of generalized forbidding matrix grammars
- An algebraic technique for context-sensitive parsing
- Pumping lemmas for the control language hierarchy
- One-sided random context grammars with leftmost derivations
This page was built for publication: Matrix grammars with a leftmost restriction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652215)
