A machine realization of the linear context-free languages

DOI10.1016/S0019-9958(67)80006-8MaRDI QIDQ5528646zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

mathematical logic

Cited in

(18)

• Theory of formal grammars
• Language acceptors with a pushdown: characterizations and complexity
• AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
• Input-driven double-head pushdown automata
• 5' 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
• scientific article; zbMATH DE number 3293667 (Why is no real title available?)
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• Centralized versions of jumping finite automata
• 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)