4 citations · 8 across the 5 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.FL2009★ 2 cited
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)…
math.PR2009★ 4 cited
A note on the Poisson boundary of lamplighter random walks
Ecaterina Sava
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups endowed with a rich boundary. The starting…