A criterion for the simplicity of finite Moore automata

  A. Ádám

Abstract:

  A Moore automaton can be obtained in two steps: first we consider the triplet - called a semiautomaton and denoted by - and then we add the components and which concern the output functioning. Our approach is: is supposed to be fixed, we vary in any possible way, and - among the resulting automata - we want to separate the simple and the nonsimple ones from each other. This task is treated by combinatorial methods. Concerning the efficiency of the procedure, we note that it uses a semiautomaton having states.

 Gyenizse Pal 1996. Szeptember 4. Szerda 13:36:30 MET DST