Multihead one-way finite automata

DOI10.1016/0304-3975(91)90051-3zbMath0746.68051OpenAlexW1999810953MaRDI QIDQ1183574

Mirosław Kutyłowski

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90051-3

zbMATH Keywords

language recognitionlower bounds on complexitymultihead finite automata

Mathematics Subject Classification ID

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

Related Items (3)

Remarks on sorting and one-way multihead finite automata ⋮ Binding-blocking automata ⋮ One-way multihead finite automata and 2-bounded languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of one-way multihead automata languages
• Remarks on string-matching and one-way multihead automata
• On 3-head versus 2-head finite automata
• On tape-bounded complexity classes and multihead finite automata
• One way multihead deterministic finite automata
• Multitape one-way nonwriting automata
• One-way multihead writing finite automata
• k + 1 Heads Are Better than k
• On Multi-Head Finite Automata
• One-way multihead finite automata and 2-bounded languages

This page was built for publication: Multihead one-way finite automata