Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 10 (1981), S. 331-340 
    ISSN: 1573-7640
    Keywords: Markov DTOL systems ; cut-point ; stochastic grammars ; probabilistic grammars ; language family ; collection of language families ; dense hierarchy ; accumulation point
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: 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.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...