A finite 5-pebble-automaton can search every maze (Q1050773)

From MaRDI portal
Revision as of 09:20, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A finite 5-pebble-automaton can search every maze
scientific article

    Statements

    A finite 5-pebble-automaton can search every maze (English)
    0 references
    1982
    0 references
    finite automaton
    0 references
    labyrinth
    0 references
    pebbles
    0 references
    0 references

    Identifiers