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.
KeywordsAutomatic Sequence Numeration System Finite State Automaton Number Format Input Alphabet
Unable to display preview. Download preview PDF.
- 2.Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)Google Scholar
- 6.Grabmayer, C., Endrullis, J., Hendriks, D., Klop, J.W., Moss, L.S.: Automatic Sequences and Zip-Specifications. In: Proc. Symp. on Logic in Computer Science (LICS 2012), pp. 335–344. IEEE Computer Society (2012)Google Scholar
- 7.Grabmayer, C., Endrullis, J., Hendriks, D., Klop, J.W., Moss, L.S.: Automatic Sequences and Zip-Specifications. Tech. Rep. 1201.3251, arXiv (2012), http://arxiv.org/abs/1201.3251v1
- 8.Knuth, D.E.: The Art of Computer Programming, vol. II: Seminumerical Algorithms, 2nd edn. Addison-Wesley (1981)Google Scholar