• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2013, Volume: 6, Issue: Supplementary 5, Pages: 1-6

Original Article

Algorithm for Automaton Specification for Exploring Dynamic Labyrinths


A variety of interesting problems arise in the study of finite automata that move about in a two dimensional space. The model proposed by Muller [4] is used here to construct new automaton which can explore any labyrinth and escape through the moving or dynamic obstacles inside over the grid. The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states. In this paper we allow obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit.
Keywords: Labyrinths, Finite State Automaton, Printing Mouse, Free Way of Escape


Subscribe now for latest articles and news.