Periodically time-variant context-free grammars
From MaRDI portal
Publication:5627630
DOI10.1016/S0019-9958(70)90464-XzbMath0222.68032MaRDI QIDQ5627630
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Related Items (15)
On vector languages ⋮ Monotonically controlling right linear grammars with unknown behaviors to output a target string ⋮ Programmed OL-systems ⋮ Reducing control alphabet size for the control of right linear grammars with unknown behaviors ⋮ On coupled languages and translations ⋮ Size, index, and context-sensitivity of controlled partition grammars ⋮ Control sets on context-free grammar forms ⋮ Conditional Grammars ⋮ The complexity of the membership problem for some extensions of context-free languagest† ⋮ An algebraic technique for context-sensitive parsing ⋮ Control sets on grammars using depth-first derivations ⋮ A note on leftmost restricted random context grammars ⋮ Some concepts for languages more powerful than context-free ⋮ Normal forms for context-sensitive grammars ⋮ Theory of formal grammars
This page was built for publication: Periodically time-variant context-free grammars
