One-Way Multi-Head Finite Automata with Pebbles But No States

DOI10.1007/978-3-642-38771-5_28MaRDI QIDQ5300850zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 28 June 2013

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38771-5_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Stateless one-way multi-head finite automata with pebbles
• Multihead one-way finite automata
• scientific article; zbMATH DE number 3980491
• scientific article; zbMATH DE number 3978428
• One-way reversible multi-head finite automata
• One-way reversible multi-head finite automata
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• One-way multihead finite automata and 2-bounded languages
• The equivalence of pebbles and sensing heads for finite automata
• Simulations of unary one-way multi-head finite automata

Cited in

(4)

• On pebble automata
• On Pebble Automata for Data Languages with Decidable Emptiness Problem
• The equivalence of pebbles and sensing heads for finite automata
• Stateless one-way multi-head finite automata with pebbles

This page was built for publication: One-Way Multi-Head Finite Automata with Pebbles But No States

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