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

DOI10.1016/0020-0190(84)90077-2zbMATH Open0571.68070OpenAlexW2081273948MaRDI QIDQ1061497FDOQ1061497

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

algorithmRAMtime complexitylanguage recognitionlinear context-free languages

Mathematics Subject Classification ID

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

Cites Work

• Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
• Title not available (Why is that?)

Cited In (2)

• One-counter automata for parsing and language approximation
• One-variable context-free hedge automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061497)