• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.563-571
• /
• 1997

In this paper we define CR(completely reachable), MICR(minimal cyclic refinement)and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.1-9
• /
• 1998

In this paper we define CR(completely reachable), MICR(minimal cyclic refinement) and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also, we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

• Journal of applied mathematics & informatics
• /
• v.17 no.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.