The basis automaton for the given regular language |
| |
| Authors: | A. A. Vakhitova |
| |
| Affiliation: | 1. Department of Applied Mathematics, Dimitrovgrad Branch of Simbirsk Polytechnik University, Branch of Polytechnik University, 433510, Dimitrovgrad, Russia
|
| |
| Abstract: | A new problem of the theory of finite automata (Rabin-Scott’s automata) is considered. So called basis automaton for the given regular languageL is defined. This automaton is unique for the givenL, it is defined by two automata of canonical form: forL and for its inverse languageL R. 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
