Mix-automatic sequences form a proper extension of the class of automatic sequences, and arise from a generalization of finite state automata where the input alphabet is state-dependent. In this paper we compare the class of mix-automatic sequences with the class of morphic sequences. For every polynomial π we construct a mix-automatic sequence whose subword complexity exceeds π. This stands in contrast to automatic and morphic sequences which are known to have at most quadratic subword complexity. We then adapt the notion of k-kernels to obtain a characterization of mix-automatic sequences, and employ this notion to construct morphic sequences that are not mix-automatic. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Endrullis, J., Grabmayer, C., & Hendriks, D. (2013). Mix-automatic sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 262–274). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_24
Mendeley helps you to discover research relevant for your work.