A machine realization of the linear context-free languages
From MaRDI portal
Publication:5528646
DOI10.1016/S0019-9958(67)80006-8zbMath0149.24804OpenAlexW2089236668MaRDI QIDQ5528646
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(67)80006-8
Related Items (16)
On the closure properties of linear conjunctive languages. ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On linear languages recognized by deterministic biautomata ⋮ Unnamed Item ⋮ Input-Driven Double-Head Pushdown Automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Unnamed Item ⋮ Learning two-tape automata from queries and counterexamples ⋮ Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) ⋮ Unnamed Item ⋮ Two-Sided Strictly Locally Testable Languages ⋮ NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY ⋮ Multitape finite automata with rewind instructions ⋮ Theory of formal grammars ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
This page was built for publication: A machine realization of the linear context-free languages
