• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.851-858
• /
• 1999

A new problem of the theory of finite automata (Rabin-Scott's automata) is considered. So called basis automaton for the given regular language l is defined. this automaton is unique for the given L, it is defined by two au-tomata of canonical form: for L and for its inverse language LR. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks dealing with the given regular language.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.379-392
• /
• 1999

The problem of the state-minimization for the nonde-terministic finite Rabin-Scott's automata is considered. A new algo-rithm for this problem is obtained. The obtained algorithm has the exponential effectiveness like the earlier-known algorithms for this problem. But each of previous algo-rithms amounts to the search of minimum generative system for local reaction of equal automaton of canonical form and unlike them we use in this paper two special function marking states of the given automaton.