Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1993: STACS 93 pp 333–342Cite as

Local automata and completion

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 665))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.P. Beal, Codes circulaire, automates locaux et entropie, Theoret. Comput. Sci., 57 (1988), 283–302.

    Google Scholar 

  2. J. Berstel and D. Perrin, Theory of Codes, Academic Press, New York, London, 1985.

    Google Scholar 

  3. V. Bruyere, Completion of codes, Proc. Colloquium on Words, Languages and Combinatorics, World Scientific Publishing Singapore, M. Ito, ed., 1992, 30–44.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. R. McNaughton and S. Papert, Counter Free Automata, MIT Press, Cambridge, Mass., 1971.

    Google Scholar 

  6. M. Perles, M.O. Rabin and E. Shamir, The theory of definite automata, IEEE Trans. Electron. Comput., EC-12 (1963), 233–243.

    Google Scholar 

  7. M.P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, 8 (1965), 190–194.

    Google Scholar 

  8. A. Restivo, On a question of McNaughton and Papert, Information and Control, 25 (1974), 93–101.

    Google Scholar 

  9. A. Restivo, A combinatorial property of codes having finite synchronization delay, Theoret. Comput. Sci., 1 (1975), 95–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni, Universitá di Palermo, via Archirafi, 34, I-90123, Palermo, Italy

    Rosa Montalbano

Authors
  1. Rosa Montalbano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation