Way to represent finite automata

摘要

1. A method for representation of finite automaton comprising a representation of its states using predicates and their construction on the basis of the full set of states reachable from its current state, characterized in that the assignment is carried out in a finite automaton predicate matrix-form in a square matrix, wherein values ​​of elements determining true values ​​predikata.2. A method according to claim 1, characterized in that the values ​​of the elements of the square matrix determines true values ​​five-predicate or the predicate, which area is not limited to (n-ary predicate).