Skip to main content
SpringerLink
Log in

Rudimentary relations and stack languages

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The rudimentary relations, defined by Smullyan (1961), are known to contain the contextfree languages. It is shown here that the one-way stack languages and their complements are also rudimentary.

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

Similar content being viewed by others

References

  1. J. Bennett,On Spectra, Doctoral Dissertation, Princeton University, 1963.

  2. J. Hartmanis, On Non-Determinancy in Simple Computing Devices,Acta Informatica,1 (1972), pp. 336–344.

    Google Scholar 

  3. J. E. Hopcroft andJ. D. Ullman, Sets Accepted by One-Way Stack Automata are Context Sensitive,Information and Control,13 (1968), pp. 114–133.

    Google Scholar 

  4. J. E. Hopcroft andJ. D. Ullman,Formal Languages and heir Relations to Automata. Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  5. N. Jones, Context-Free Languages and Rudimentary Attributes,Mathematical Systems Theory,3 (1969), pp. 102–109.

    Google Scholar 

  6. J. Myhill, Linear Bounded Automata,Wright Air Development Division Tec. te, No. 60-165, 1960.

  7. V. A. Nepomnuyashchii, Rudimentary Modelling of Indeterminate Turing Calculations,Cybernetics,9 (1975), pp. 212–218.

    Google Scholar 

  8. R. Smullyan, Theory of Formal Systems,Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.

  9. Y. Yu,Rudimentary Relations and Formal Languages, Doctoral Dissertation, University of California, Berkeley, California, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of San Francisco, 94117, San Francisco, California, USA

    Ytha Y. Yu

Authors
  1. Ytha Y. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, Y.Y. Rudimentary relations and stack languages. Math. Systems Theory 10, 337–343 (1976). https://doi.org/10.1007/BF01683283

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation