Abstract
Letp satisfy 0 ⩽p < 1, then by ℳ(p) we denote the family of Markov DTOL languages with cut pointp. In this paper we present a complete classification of the collection ℳ of such families ℳ(p), 0 ⩽p < 1, showing that ℳ forms an infinite nondense hierarchy with ℳ(0) being its only accumulation point from below. Furthermore it is proved that each language in ℳ(p) can be expressed as a finite union of DDTOL languages.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Jürgensen, D. E. Matthews, and D. Wood, “Life and death in Markov deterministic tabled OL systems,”Information and Control 48: 80–93 (1981).
H. A. Maurer, A. Salomaa, and D. Wood, “Dense hierarchies of grammatical families,”Journal of the ACM (1981), to appear.
H. A. Maurer, A. Salomaa, and D. Wood, “Context-free grammar forms with strict interpretations,”Journal of Computer and System Sciences 21: 110–135 (1980).
D. Cox and H. Miller,The Theory of Stochastic Processes (John Wiley and Sons, Inc., New York, 1965).
G. Rozenberg and A. Salomaa,The Mathematical Theory of L Systems (Academic Press, Inc., New York, 1980).
K. Culik II and D. Wood, “Doubly deterministic tabled OL systems,”International Journal of Computer and Information Sciences 8: 335–347 (1979).
Author information
Authors and Affiliations
Additional information
Work supported partially by the Natural Sciences and Engineering Research Council of Canada grants Nos. A-3590 and A-7700, and partially by Deutsche Forschungsgemeinschaft.
Rights and permissions
About this article
Cite this article
Jürgensen, H., Matthews, D.E. & Wood, D. Cut point languages of markov DTOL systems. International Journal of Computer and Information Sciences 10, 331–340 (1981). https://doi.org/10.1007/BF00993151
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00993151