Turn-bounded grammars and their relation to ultralinear languages
From MaRDI portal
Publication:4103193
DOI10.1016/S0019-9958(76)90228-XzbMath0336.68032MaRDI QIDQ4103193
Publication date: 1976
Published in: Information and Control (Search for Journal in Brave)
Related Items (3)
Finite turns and the regular closure of linear context-free languages ⋮ Streaming algorithms for language recognition problems ⋮ Quasi-rocking real-time pushdown automata
This page was built for publication: Turn-bounded grammars and their relation to ultralinear languages
