Skip to main content
Log in

Bounded quantification and relations recognizable by finite automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The concept of inverse well-known for homomorphisms and gsm-mappings is extended to any language operation. The class IRP of language operations whose inverse preserves regularity is considered. As an application a necessary and sufficient condition is established for the class of relations recognizable by finite automata to be closed under different versions of bounded quantification.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Eilenberg, S.: Automata, languages and machines, Vol. A. New York: Academic Press 1974

    Google Scholar 

  2. Ottmann, Th.: Mit regulären Grundbegriffen definierbare Prädikate. Computing 14, 213–223 (1975)

    Google Scholar 

  3. Smullyan, R.: Formal systems. Princeton University Press 1961

  4. Stearns, R.E., Hartmanis, J.: Regularity preserving modifications of regular expressions. Information and Control 6, 55–69 (1963)

    Google Scholar 

  5. Wrathall, C.: Subrecursive predicates and automata. Doctoral Thesis, Yale University, October 1975

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laurinolli, T. Bounded quantification and relations recognizable by finite automata. Acta Informatica 10, 67–78 (1978). https://doi.org/10.1007/BF00260924

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation