LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that eve...LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ? with delay τ over R has a linear finite automaton ?′ over R which is a (weak) inverse with delay τ of ?. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ? overR has a linear finite automaton ?′ over R which is an inverse with delay τ′ for some τ′?τ is studied and solved.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No. 69773015)
文摘LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ? with delay τ over R has a linear finite automaton ?′ over R which is a (weak) inverse with delay τ of ?. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ? overR has a linear finite automaton ?′ over R which is an inverse with delay τ′ for some τ′?τ is studied and solved.
