Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions

Wilfried Huss, Ecaterina Sava, Wolfgang Woess

A language L over a finite alphabet is growth-sensitive (or entropy sensitive) if forbidding any set of subwords F yields a sub-language L^F whose exponential growth rate (entropy)…