Skip to main content
SpringerLink
Log in

Algebraic decision procedures for local testability

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

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

    Google Scholar 

  2. N. Chomsky andM. P. Schützenberger, The algebraic theory of context-free languages, inComputer Programming and Formal Systems (P. Braffort and D. Hirschberg, editors), North Holland, Amsterdam, 1963, pp. 118–161.

    Google Scholar 

  3. L. S. Levy andM. Freeman, Finitely generated events, unpublished paper, 1970.

  4. R. McNaughton andS. Papert,Counter-free Automata, M.I.T. Press, Cambridge, Mass., 1971.

    Google Scholar 

  5. Yu. T. Medvedev, On the class of events representable in a finite automaton (translated from the Russian), inSequential Machines—Selected Papers (E. F. Moore, ed.), Addison-Wesley, 1964, pp. 215–227.

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

    Google Scholar 

  7. F. P. Ramsey, On a problem of formal logic,Proc. London Math. Soc.,30 (Ser. 2, 1928), Part 4, 338–384. Reprinted in a paperback,The Foundations of Mathematics and other Logical Essays, by F. P. Ramsey, Littlefield, Adams and Co., Patterson, N. J., 1960. (This book was first printed by Routledge and Kegan Paul, London, 1931).

    Google Scholar 

  8. Y. Zalcstein, Locally testable languages,J. Computer Systems Science 6 (1972), 151–167.

    Google Scholar 

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

    Google Scholar 

  10. Y. Zalcstein, Syntactic semigroups of some classes of star-free languages,Proc. International Symposium on Theory of Automata, Languages and Programming (IRIA, Paris), North Holland Publishing Company, Amsterdam, 1972, pp. 135–144.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Rensselaer Polytechnic Institute, Troy, N. Y., USA

    Robert McNaughton

Authors
  1. Robert McNaughton
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research for and production of this paper were supported in large part by NSF grant GP-24335.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McNaughton, R. Algebraic decision procedures for local testability. Math. Systems Theory 8, 60–76 (1974). https://doi.org/10.1007/BF01761708

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01761708

Keywords

Search

Navigation