Using an asymptotic characterization of probabilistic finite state languages over a one-letter alphabet we construct a probabilistic language with regular support that cannot be generated by ...

Mathematical background -- Linear generative grammars -- Stepmatrices -- From phonons to the speech signal -- Binary tree grammars -- Conversion grammars -- Ensembles ...