On linear context-free languages and one-way multihead automata

DOI10.1016/0020-0190(84)90077-2zbMath0571.68070OpenAlexW2081273948MaRDI QIDQ1061497

Wojciech Rytter

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90077-2

zbMATH Keywords

algorithmtime complexityRAMlanguage recognitionlinear context-free languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
• Unnamed Item

This page was built for publication: On linear context-free languages and one-way multihead automata