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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	3917-3922
Journal	Theoretical Computer Science
Volume	411
Issue number	44-46
DOIs	https://doi.org/10.1016/j.tcs.2010.07.020
Publication status	Published - 2010

Treatment code (Nähere Zuordnung)

@article{d8197fd5a3ce46f988181a902e12108f,

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

author = "Wilfried Huss and Ecaterina Sava and Wolfgang Woess",

year = "2010",

doi = "10.1016/j.tcs.2010.07.020",

language = "English",

volume = "411",

pages = "3917--3922",

journal = "Theoretical Computer Science",

issn = "1879-2294",

publisher = "Elsevier B.V.",

number = "44-46",

}

TY - JOUR

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

AU - Huss, Wilfried

AU - Sava, Ecaterina

AU - Woess, Wolfgang

PY - 2010

Y1 - 2010

UR - http://www.sciencedirect.com/science/journal/03043975

UR - http://www.math.tugraz.at/~woess/papers/sensitivity.pdf

U2 - 10.1016/j.tcs.2010.07.020

DO - 10.1016/j.tcs.2010.07.020

M3 - Article

SN - 1879-2294

VL - 411

SP - 3917

EP - 3922

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 44-46

ER -