• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.671-678
• /
• 2005

In this paper we shall give some characterizations of strongly cyclic and totally reachable (TR) automata when A = (M, X, $\delta$) is MinCR-automaton. Also we shall see that if an automaton A is strongly cyclic, then A is cyclic and a TR-automaton. When A is MinmaxCR-automaton, we shall give another characterizations for a strongly cyclic and cyclic TR-automaton.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.663-670
• /
• 2005

In this paper we shall give some decompositions derived from cyclic subautomata or neighborhoods of the automaton. Also we shall discuss some characterizations of cyclic automata when an automaton is maximal cyclic refinement. If m $\in$ M is totally reachable state, we shall see that {$mX^{\ast}$} is minimal.