Search arXivSearch

arXiv · 2006.02316

Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata

Abstract

The ring $\mathbb Z_d$ of $d$-adic integers has a natural interpretation as the boundary of a rooted $d$-ary tree $T_d$. Endomorphisms of this tree (i.e. solenoid maps) are in one-to-one correspondence with 1-Lipschitz mappings from $\mathbb Z_d$ to itself and automorphisms of $T_d$ constitute the group $\mathrm{Isom}(\mathbb Z_d)$. In the case when $d=p$ is prime, Anashin showed that $f\in\mathrm{Lip}^1(\mathbb Z_p)$ is defined by a finite Mealy automaton if and only if the reduced coefficients of its van der Put series constitute a $p$-automatic sequence over a finite subset of $\mathbb Z_p\cap\mathbb Q$. We generalize this result to arbitrary integer $d\geq 2$, describe the explicit connection between the Moore automaton producing such sequence and the Mealy automaton inducing the corresponding endomorphism. Along the process we produce two algorithms allowing to convert the Mealy automaton of an endomorphism to the corresponding Moore automaton generating the sequence of the reduced van der Put coefficients of the induced map on $\mathbb Z_d$ and vice versa. We demonstrate examples of applications of these algorithms for the case when the sequence of coefficients is Thue-Morse sequence, and also for one of the generators of the standard automaton representation of the lamplighter group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rostislav Grigorchuk, Dmytro Savchuk. 2020-06-03. Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata. https://arxiv.org/abs/2006.02316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Simple grammar bisimilarity, with an application to session type equivalence

We provide an algorithm for deciding simple grammar bisimilarity whose complexity is polynomial in the valuation of the grammar (maximum seminorm among production rules). Since the valuation is at most exponential in the size of the grammar, this gives rise to a (single) exponential running time. Previously only a double-exponential algorithm was known. As an application, we provide a conversion from context-free session types to simple grammars whose valuation is linear in the size of the type. In this way, we provide the first polynomial-time algorithm for deciding context-free session type equivalence.

cs.FL

Testing and Learning Symbolic Finite State Machines

Symbolic finite state machines (SFSMs) describe input/output behaviour using guards and output assignments with possibly infinite data domains. We study deterministic and completely specified SFSMs whose guards and output assignments depend only on the current input. We define finite representative input sets that contain witnesses for relevant guard overlaps and separating witnesses for output assignments that differ on those overlaps. Our main theorem shows that language equivalence of the finite instantiations implies language equivalence over the full input domain. This result transfers complete testing methods for deterministic finite state machines (DFSMs) to SFSMs, provided finite sets of admissible guards and output assignments and an upper bound on the number of distinguishable reachable states are known. Under these assumptions, a DFSM learner with complete testing can learn a finite instantiation, which is then lifted to an equivalent SFSM. We establish a bound on the size of representative input sets and give an SMT construction whose correctness and termination hold under stated solver assumptions.

cs.FL

Recognizable Picture Languages: Separating UREC from coUREC via Communication Complexity

We introduce communication-complexity lifting techniques into the study of recognizable picture languages. As an application, we resolve a long-standing open problem of Anselmo et al. (2006) by constructing a language in UREC whose complement does not belong to REC. Our lower-bound argument is inspired by the communication-complexity approach to unambiguous automata of Göös et al. (2022), although its implementation in the setting of picture languages requires substantially different technical ingredients.

cs.FL