• 제목/요약/키워드: minimal subautomata

검색결과 3건 처리시간 0.014초

ON MINMAX AND PRIMARY SUBAUTOMATA ASSOCIATED WITH THE SOURCE

  • Park, Chin-Hong;Shim, Hong-Tae
    • Journal of applied mathematics & informatics
    • /
    • 제16권1_2호
    • /
    • pp.585-593
    • /
    • 2004
  • In this paper we shall discuss the minimal, maximal and primary subautomata. Also the concepts of the totally reachable state and source will be introduced. It is an interesting part that mX* is minimal iff the source S(m) is maximal. We shall point out that the characterization of primary subautomaton comes from the properties associated with the sources S(m)'s.

ON PROPERTIES OF MINMAX SUBAUTOMATA

  • Park, Chin-Hong;Shim, Hong-Tae
    • Journal of applied mathematics & informatics
    • /
    • 제16권1_2호
    • /
    • pp.595-604
    • /
    • 2004
  • In this paper We shall give some characterizations for mX* derived from the relationships between S(m) and C(m). Also we shall discuss the minimal, maximal, strongly cyclic and minmaxCR-automata. There is an interesting part for the relationship between mX* and S(m). That is to say, that mX* is minimal has the same meaning as S(m) is strongly cyclic. We shall note that the minimality implies ‘ strongly cyclic’ and ‘strongly cyclic’ implies ‘cyclic’ and ‘cyclic’ implies ‘a MaxCR-automaton’.

ON DECOMPOSABLE AND CYCLIC AUTOMATA

  • PARK CHIN HONG;SHIM HONG TAE
    • 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.