Abstract
The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.P. Beal, Codes circulaire, automates locaux et entropie, Theoret. Comput. Sci., 57 (1988), 283–302.
J. Berstel and D. Perrin, Theory of Codes, Academic Press, New York, London, 1985.
V. Bruyere, Completion of codes, Proc. Colloquium on Words, Languages and Combinatorics, World Scientific Publishing Singapore, M. Ito, ed., 1992, 30–44.
S. Kim, R. McNaghton and R. McCloskey, A polynomial time algorithm for the local testability problem of deterministic finite automata, Proc. Workshop on Algorithms and Data Structures 89. Lecture Notes in Computer Science, 382 (1989), 420–436.
R. McNaughton and S. Papert, Counter Free Automata, MIT Press, Cambridge, Mass., 1971.
M. Perles, M.O. Rabin and E. Shamir, The theory of definite automata, IEEE Trans. Electron. Comput., EC-12 (1963), 233–243.
M.P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, 8 (1965), 190–194.
A. Restivo, On a question of McNaughton and Papert, Information and Control, 25 (1974), 93–101.
A. Restivo, A combinatorial property of codes having finite synchronization delay, Theoret. Comput. Sci., 1 (1975), 95–101.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montalbano, R. (1993). Local automata and completion. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_34
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive