Skip to main content
SpringerLink
Log in

Simple context-free languages and free monadic recursion schemes

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown store acceptor that operates in real-time and accepts by empty store. While the problem remains open of deciding whether or not the language accepted by a deterministic pushdown store acceptor is simple, it is shown that this problem is equivalent to another problem in schemata theory. This question is that of determining whether or not a monadic recursion scheme has a strongly equivalent free scheme.

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. E. Ascroft, Z. Manna andA. Puneli, Decidable Properties of Monadic Functional Schemes,JACM 20 (1973), 489–499.

    Google Scholar 

  2. B. Courcelle,Ensembles Algebriques d'Arbres et Languages Deterministes; quelques applications aux Schemas de Programme, IRIA/LABORIA, November 1975.

    Google Scholar 

  3. E. P. Friedman, Equivalence Problems for Deterministic Context-free Languages and Monadic Recursion Schemes, to Appear inJCSS.

  4. S. J. Garland andD. C. Luckham, “Program Schemes, Recursion Schemes, and Formal Languages”,J. Computer and System Science 7 (1973), 119–160.

    Google Scholar 

  5. M. M. Geller and M. A. Harrison, Characterizations ofLR(O) Languages,14th Annual Symposium on Switching and Automata Theory, IEEE Computer Society, Iowa City, Iowa (1973), 103–108.

  6. S. Ginsburg andS. A. Greibach, Deterministic Context-Free Languages,Information and Control,9 (1966), 620–648.

    Google Scholar 

  7. S. Ginsburg andE. Spanier, Finite-Turn Pushdown Automata,SIAM J. on Control 4 (1966), 423–434.

    Google Scholar 

  8. S. A. Greibach,Private Communication.

  9. M. A. Harrison andI. M. Havel, Strict Deterministic Grammars,J. Computer and System Sciences 7 (1973), 237–277.

    Google Scholar 

  10. A. J. Korenjak and J. E. Hopecroft, Simple Deterministic Languages,IEEE Conference Record of 7th Annual Symposium on Switching and Automata Theory (1966), 36–46.

  11. M. O. Rabin andD. Scott,Finite Automata and Their Decision Problems, Sequential Machines: Selected Papers (E. F. Moore, ed.), Addison-Wesley, Reading, Mass., 63–91, 1964.

    Google Scholar 

  12. D. J. Rosenkrantz andR. E. Stearns, Properties of Deterministic Top-Down Grammars,Information and Control 17 (1970), 226–256.

    Google Scholar 

  13. R. E. Steans, A Regularity Test for Pushdown Machines,Information and Control,11 (1967), 323–340.

    Google Scholar 

  14. L. G. Valiant,Decision Procedures for Families of Deterministic Pushdown Automata, Ph.D. Thesis, Computer Centre Report No. 7, U. of Warwick, Coventry, England, 1973.

    Google Scholar 

  15. L. G. Valiant, Regularity and Related Problems for Deterministic Pushdown Automata,JACM,22 (1975), 1–10.

    Google Scholar 

  16. L. G. Valiant andM. S. Paterson, Deterministic One-Counter Automata,J. Computer and System Science 10 (1975), 340–350.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and System Science Departments, University of California, 3532 Boelter Hall, 90024, Los Angeles, California, USA

    Emily P. Friedman

Authors
  1. Emily P. Friedman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation, Grant No. NSF GJ-803 and DCR74-15091.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Friedman, E.P. Simple context-free languages and free monadic recursion schemes. Math. Systems Theory 11, 9–28 (1977). https://doi.org/10.1007/BF01768465

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation