400 search results - page 2 / 80 » Rational stochastic languages |
ACTA
2005
13 years 7 months ago
2005
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
ITA
2006
13 years 7 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
ICDT
2010
ACM
13 years 10 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...