|
This article is cited in 1 scientific paper (total in 1 paper)
Computer science
Morphismes based on compatible tolerances of finite automata
I. P. Mangusheva Saratov State University named after N. G. Chernyshevsky
Abstract:
It is suggested a method of a construction with the help of some triple of tolerances defined on the sets of states, input and output symbols of an finite definite automaton an another automaton which is connected with the original automaton by a certain morphism. Considered construction generalizes the known method of finding of the homomorphic images of an automaton with the help of a triple of equivalences, which satisfies to the certain conditions.
Key words:
finite determined automaton, homomorphic image, congruence, compatible tolerances, tolerant image, partition, covering.
Citation:
I. P. Mangusheva, “Morphismes based on compatible tolerances of finite automata”, Izv. Saratov Univ. Math. Mech. Inform., 8:4 (2008), 80–90
Linking options:
https://www.mathnet.ru/eng/isu134 https://www.mathnet.ru/eng/isu/v8/i4/p80
|
|