Skip to main content
SpringerLink
Log in

On some properties of local testability

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

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

Included in the following conference series:

  • 121 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brzozowski, J.A. and I. Simon, Characterizations of locally testable events, Discrete Math., 4 (1973) 243–271.

    Google Scholar 

  2. de Luca, A. and A. Restivo, Synchronization and maximality for very pure subsemigroups of a free semigroup, Lectures Notes in Computer Science, vol. 74, Springer-Verlag (1979).

    Google Scholar 

  3. de Luca, A. and A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup (1980), Information and Control (to appear).

    Google Scholar 

  4. Eilenberg, S., "Automata, Languages and Machines", Academic Press, New York, vol. A (1974), vol. B (1976)

    Google Scholar 

  5. Hashiguchi, K. and N. Honda, Properties of code events and homomorphisms over regular events, J.Comput. System Sci. 12 (1976) 352–367.

    Google Scholar 

  6. McNaughton, R., Algebraic decision procedures for local testability, Math. Systems Theory, 8 (1974) 60–76.

    Google Scholar 

  7. McNaughton, R. and S. Papert, "Counter-Free Automata", MIT Press, Cambridge, Mass 1971.

    Google Scholar 

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

    Google Scholar 

  9. Restivo, A., A combinatorial property of codes having finite synchronization delay, Theoretical Computer Science, 1 (1975), 95–101.

    Google Scholar 

  10. Schützenberger, M.P., Une théorie algébrique du codage, Séminaire Dubreil-Pisot (Algebre et Théorie des nombres), exposé no. 15, 1955/1956, Paris.

    Google Scholar 

  11. Schützenberger, M.P., Sur certaines opérations de fermeture dans les langages rationnels, Symposia Mathematica XV (1975) 245–253.

    Google Scholar 

  12. Zalcstein, Y., Locally testable semigroups, Semigroup Forum, 5 (1973) 216–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Cibernetica del CNR, Arco Felice, Napoli, Italy

    Aldo de Luca & Antonio Restivo

Authors
  1. Aldo de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Restivo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., Restivo, A. (1980). On some properties of local testability. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation