Automaton recognition of doubly connected labyrinths with finite cyclic diameter

DOI10.1134/S0361768810030035zbMath1251.68139MaRDI QIDQ1758672

Biljana Stamatovic

Publication date: 16 November 2012

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

chess labyrinthsfinite cyclic diameterrecognizing automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Algorithm for identification of infinite clusters based on minimal finite automaton

Cites Work

• Unnamed Item
• On behaviour of automata in labyrinths

This page was built for publication: Automaton recognition of doubly connected labyrinths with finite cyclic diameter