Matrix grammars with a leftmost restriction
From MaRDI portal
Publication:5652215
DOI10.1016/S0019-9958(72)90332-4zbMath0241.68033MaRDI QIDQ5652215
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Related Items (15)
One-Sided Random Context Grammars with Leftmost Derivations ⋮ Pumping lemmas for the control language hierarchy ⋮ On some derivation mechanisms and the complexity of their Szilard languages ⋮ Upper bounds on recognition of a hierarchy of non-context-free languages ⋮ State grammars with stores ⋮ On state-alternating context-free grammars ⋮ Size, index, and context-sensitivity of controlled partition grammars ⋮ Context-free grammars with graph-controlled tables ⋮ Classes of formal grammars ⋮ The complexity of the membership problem for some extensions of context-free languagest† ⋮ An algebraic technique for context-sensitive parsing ⋮ On the Complexity of Szilard Languages of Regulated Grammars ⋮ A note on leftmost restricted random context grammars ⋮ ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS ⋮ Normal forms for context-sensitive grammars
This page was built for publication: Matrix grammars with a leftmost restriction
