Abstract
In this paper, we first give a method that for any inverse finite automaton M′ with delay τ, all inver tible finite automata with delay τ, of whichM′ is an inverse with delay τ, can be constructed; and a universal nondeterministic finite automaton, for all finite automata of whichM′ is an inverse with delay τ, can also be constructed. We then give a method that for any weak inverse finite automatonM′ with delay τ, all weakly invertible finite automata with delay τ of whichM′ is a weak inverse with delay, can be constructed; and a universal nondeterministic finite automaton, for all finite automata of whichM′ is a weak inverse with delay τ, can also be constructed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Tao Renji, Invertibility of finite automata, Science Press, Beijing, China, 1979 (in Chinese).
Tao Renji and Chen Shihua, Some properties on the structure of invertible, and inverse finite automata with delay τ,Chinese J. of Computers,3 (1980), 289–297 (In Chinese).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, S. On the structure of finite automata of whichM′ is an (weak) inverse with delay τ. J. of Compt. Sci. & Technol. 1, 54–59 (1986). https://doi.org/10.1007/BF02943272
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943272