Characterizing morphic sequences
Formal Languages and Automata Theory
2023-09-20 v1
Abstract
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is known to have several closure properties, for the class of morphic sequences similar closure properties are known, but only limited equivalent characterizations. In this paper we extend the latter. We discuss a known characterization of morphic sequences based on automata and we give a characterization of morphic sequences by finiteness of a particular class of subsequences. Moreover, we relate morphic sequences to rationality of infinite terms and describe them by infinitary rewriting.
Cite
@article{arxiv.2309.10562,
title = {Characterizing morphic sequences},
author = {Hans Zantema},
journal= {arXiv preprint arXiv:2309.10562},
year = {2023}
}