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
URL:
http://dx.doi.org/10.1007/BF00993151
Permalink