Sensing versus nonsensing automata

DOI10.1007/3-540-60084-1_96zbMath1412.68127OpenAlexW1532254260MaRDI QIDQ4645200

Pavol Ďuriš, Zvi Galil

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_96

zbMATH Keywords

regular languagefinite automatoninternal stateinput tapeletter alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The equivalence of pebbles and sensing heads for finite automata

Cites Work

• A note on semilinear sets and bounded-reversal multihead pushdown automata
• One-way simple multihead finite automata
• k one-way heads cannot do string-matching

This page was built for publication: Sensing versus nonsensing automata