On the entropy of regular languages
β
Tullio Ceccherini-Silberstein; Antonio MachΔ±Μ; Fabio Scarabotti
π
Article
π
2003
π
Elsevier Science
π
English
β 422 KB
Then the entropy decreases strictly: ent(L W ) Β‘ ent(L). In this note we present a new proof of this fact, based on a method of Gromov, which avoids the Perron-Frobenius theory. This result applies to the regular languages of ΓΏnitely generated free groups and an additional application is presented.