One-way multihead finite automata and 2-bounded languages

DOI10.1007/BF02090769zbMath0718.68035OpenAlexW2090680134MaRDI QIDQ5750399

Mirosław Kutyłowski

Publication date: 1990

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02090769

zbMATH Keywords

(1-MFA)2-bounded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Head and state hierarchies for unary multi-head finite automata ⋮ Multihead one-way finite automata ⋮ One-way multihead finite automata and 2-bounded languages ⋮ STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES

Cites Work

• Unnamed Item
• Hierarchies of one-way multihead automata languages
• Remarks on string-matching and one-way multihead automata
• k\(+1\) heads are better than k for PDAs
• Multihead one-way 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: One-way multihead finite automata and 2-bounded languages