120 citations · 231 across the 39 of their papers we have counts for
46 papers
A Krieger Embedding Theorem for Near Markov Sofic Shifts
Brian Marcus, Tom Meyerovitch, Chengyu Wu
Krieger's classical embedding theorem gives necessary and sufficient conditions for embedding a subshift into a mixing shift of finite type (SFT) as a proper subshift. The same res…
Rationality and computability of the covering radius for sofic shifts
Tom Meyerovitch, Aidan Young
The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of…
A new notion of dimension for dynamical systems and shift embeddability
Tom Meyerovitch
A dynamical system is \emph{shift embeddable} if embeds continuously and equivariantly in the shift over for some finite . Refuting a major conjecture…
Factorizable embeddings and the period of an irreducible sofic shift
Brian Marcus, Tom Meyerovitch, Klaus Thomsen +1
Generalizing a result of MacDonald we give necessary and sufficient conditions for an arbitrary subshift to embed into an irreducible sofic shift factoring through a given cover by…
Non-alternating mean payoff games
Tom Meyerovitch, Aidan Young
We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only a…
Kac's Lemma and countable generators for actions of countable groups
Tom Meyerovitch, Benjamin Weiss
Kac's lemma determines the expected return time to a set of positive measure under iterations of an ergodic probability preserving transformations. We introduce the notion of an \e…