Advertisement

Decidable properties of monadic recursive schemas with a depth parameter

  • J. Gonczarowski
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)

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.

Keywords

Function Variable Equivalence Problem Simple Term Derivation Tree Formal Language Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AMP]
    E. Ashcroft, Z. Manna and A. Pnueli, Decidable Properties of Monadic Functional Schemas, Journal of the ACM 20 (1973), 489–499.CrossRefGoogle Scholar
  2. [CF]
    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. [D]
    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. [E]
    J. Engelfriet, Simple Program Schemes and Formal Languages, Springer Lecture Notes in Computer Science, 20, 1974.Google Scholar
  5. [G]
    S. A. Greibach, Checking Automata and One-Way Stack Languages, Journal of Computer and System Science 3 (1969), 196–217.Google Scholar
  6. [GKR]
    J. Gonczarowski, H.C.M. Kleijn and G. Rozenberg, Grammatical Construction in Selective Substitution Grammars, in preparation.Google Scholar
  7. [GPP]
    R. E. Griswold, J. F. Poage and I. P. Plonsky, the SNOBOL4 Programming Language, Prentice-Hall, Englewood Cliffs, N.J., 1971.Google Scholar
  8. [GR]
    S. Ginsburg and G. Rozenberg, TOL Schemes and Control Sets, Information and Control 27 (1974), 109–125.CrossRefGoogle Scholar
  9. [VL]
    J. van Leeuwen, Notes on Preset Pushdown Automata, Lecture Notes in Computer Science 15 (1974), 177–188.Google Scholar
  10. [LPP]
    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. [M]
    Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974.Google Scholar
  12. [RS]
    G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1979.Google Scholar
  13. [S]
    A. Salomaa, Formal Languages, Academic Press, New York, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • J. Gonczarowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceThe Hebrew University of JerusalemJerusalemIsrael

Personalised recommendations