Skip to main content
Springer Nature Link
Log in

Decidable properties of monadic recursive schemas with a depth parameter

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

  • 125 Accesses

Abstract

Monadic table counter schemas (MTCS) are defined as extensions of recursive monadic schemas by incorporating a depth-of-recursion counter. The family of languages generated by MTCS under Herbrand interpretations is shown to be the family of ETOL languages. It is proven that the halting and divergence problems are decidable for free MTCS and that the freedom problem is decidable. These results are obtained using results on regular control sequences from L system theory.

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.

Similar content being viewed by others

References

  1. E. Ashcroft, Z. Manna and A. Pnueli, Decidable Properties of Monadic Functional Schemas, Journal of the ACM 20 (1973), 489–499.

    Article  Google Scholar 

  2. K. Culik, II and I. Fries, The decidability of the Equivalence Problem for DOL-Systems, Information and Control 36 (1978), 20–39.

    Google Scholar 

  3. P. J. Downey, OL Systems, Developmental Systems and Recursion Schemes, in "IEEE Proc. of the Conference on Biologically Motivated Automata Theory", McLean Va. (1974), 54–58.

    Google Scholar 

  4. J. Engelfriet, Simple Program Schemes and Formal Languages, Springer Lecture Notes in Computer Science, 20, 1974.

    Google Scholar 

  5. S. A. Greibach, Checking Automata and One-Way Stack Languages, Journal of Computer and System Science 3 (1969), 196–217.

    Google Scholar 

  6. J. Gonczarowski, H.C.M. Kleijn and G. Rozenberg, Grammatical Construction in Selective Substitution Grammars, in preparation.

    Google Scholar 

  7. R. E. Griswold, J. F. Poage and I. P. Plonsky, the SNOBOL4 Programming Language, Prentice-Hall, Englewood Cliffs, N.J., 1971.

    Google Scholar 

  8. S. Ginsburg and G. Rozenberg, TOL Schemes and Control Sets, Information and Control 27 (1974), 109–125.

    Article  Google Scholar 

  9. J. van Leeuwen, Notes on Preset Pushdown Automata, Lecture Notes in Computer Science 15 (1974), 177–188.

    Google Scholar 

  10. D. C. Luckham, D. M. R. Park and M. S. Paterson, On Formalized Computer Programs, Journal of Computer and System Science 4 (1970), 220–249.

    Google Scholar 

  11. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974.

    Google Scholar 

  12. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1979.

    Google Scholar 

  13. A. Salomaa, Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, 91904, Jerusalem, Israel

    J. Gonczarowski

Authors
  1. J. Gonczarowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonczarowski, J. (1983). Decidable properties of monadic recursive schemas with a depth parameter. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics