Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Decidable properties of monadic recursive schemas with a depth parameter

Summary

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 free MTCS under Herbrand interpretation 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. Most of these results are obtained using results on regular control sequences from L system theory.

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

References

  1. 1.

    Ashcroft, E., Manna, Z., Pnueli, A.: Decidable Properties of Monadic Functional Schemas. J. ACM 20, 489–499 (1973)

  2. 2.

    Courcelle, B., Franchi-Zannettacci, P.: Attribute Grammars and Recursive Program Schemes, Part I, II. Theor. Comput. Sci. 17, 163–191 and 235–257 (1982)

  3. 3.

    Culik II, K., Fris, I.: The Decidability of the Equivalence Problem for DOL Systems. Inf. Control 36, 20–39 (1978)

  4. 4.

    Downey, P.J.: OL Systems, Developmental Systems and Recursion Schemas. In: IEEE Proc. Conf. Biologically Motivated Automata Theory, McLean, Va., pp. 54–58, 1974

  5. 5.

    Engelfriet, J.: Simple Program Schemes and Formal Languages. Lect. Notes Comput. Sci. 20, (1974)

  6. 6.

    Engelfriet, J., Schmidt, E.M., van Leeuwen, J.: Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27, 96–117 (1980)

  7. 7.

    Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. 20, 150–202 (1980)

  8. 8.

    Greibach, S.A.: Checking Automata and One-Way Stack Languages. J. Comput. Syst. Sci. 3, 196–217 (1969)

  9. 9.

    Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G.: Grammatical Construction in Selective Substitution Grammars. (To appear in Acta Cybernetica)

  10. 10.

    Griswold, R.E., Poage, J.F., Polonsky, I.P.: The SNOBOL4 Programming Language. Englewood Cliffs, N.J.: Prentice-Hall 1971

  11. 11.

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

  12. 12.

    van Leeuwen, J.: Notes on Preset Pushdown Automata. ICALP. Lect. Notes Comput. Sci. 15, 177–188 (1974)

  13. 13.

    Luckham, D.C., Park, D.M.R., Paterson, M.S.: On Formalized Computer Programs. J. Comput. Syst. Sci. 4, 220–249 (1970)

  14. 14.

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

  15. 15.

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

  16. 16.

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

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Gonczarowski, J. Decidable properties of monadic recursive schemas with a depth parameter. Acta Informatica 22, 277–310 (1985). https://doi.org/10.1007/BF00265683

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory