A machine realization of the linear context-free languages
From MaRDI portal
Publication:5528646
DOI10.1016/S0019-9958(67)80006-8zbMATH Open0149.24804OpenAlexW2089236668MaRDI QIDQ5528646FDOQ5528646
Authors: Arnold L. Rosenberg 
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
Cited In (16)
- Theory of formal grammars
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- Input-driven double-head pushdown automata
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
- On the closure properties of linear conjunctive languages.
- Multitape finite automata with rewind instructions
- Nondeterministic biautomata and their descriptional complexity
- Two-Sided Strictly Locally Testable Languages
- Title not available (Why is that?)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
- On linear languages recognized by deterministic biautomata
- Learning two-tape automata from queries and counterexamples
- On two-sided locally testable languages
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Input-Driven Double-Head Pushdown Automata
This page was built for publication: A machine realization of the linear context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528646)
