A finite 5-pebble-automaton can search every maze

DOI10.1016/0020-0190(82)90117-XzbMath0513.68052MaRDI QIDQ1050773

Andrzej Szepietowski

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

finite automatonlabyrinthpebbles

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A survey of two-dimensional automata theory ⋮ Collectives of automata in finitely generated groups

Cites Work

• Unnamed Item

This page was built for publication: A finite 5-pebble-automaton can search every maze