Sensing versus nonsensing automata

DOI10.1007/3-540-60084-1_96MaRDI QIDQ4645200zbMATH OpenOpenAlexFDO

Authors 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

finite automatoninput tapeinternal stateletter alphabetregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The equivalence of pebbles and sensing heads for finite automata
• Fooling a two-way nondeterministic multihead automaton with reversal number restriction
• One-way multihead finite automata and 2-bounded languages
• scientific article; zbMATH DE number 3978428
• Regular sensing

Cites work

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

Cited in

(2)

• Regular sensing
• The equivalence of pebbles and sensing heads for finite automata

This page was built for publication: Sensing versus nonsensing automata

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