Abstract
Transducers order infinite sequences into natural classes, but permutation transducers provide a finer classification, respecting certain changes to finite segments. We investigate this hierarchy for non-periodic sequences over \(\{0,1\}\) in which the groups of 0s and 1s grow according to simple functions like polynomials. In this hierarchy we find infinite strictly ascending chains of sequences, all being equivalent with respect to ordinary transducers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)
Bosma, W., Zantema, H.: Ordering sequences by permutation transducers. Indagationes Math. 38, 38–54 (2017)
Endrullis, J., Grabmayer, C., Hendriks, D., Zantema, H.: The degree of squares is an atom. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 109–121. Springer, Cham (2015). doi:10.1007/978-3-319-23660-5_10
Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. Integers Electron. J. Comb. Number Theor. 11B(A6), 1–40 (2011). Proceedings of Leiden Numeration Conference (2010)
Endrullis, J., Karhumäki, J., Klop, J.W., Saarela, A.: Degrees of infinite words, polynomials and atoms. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 164–176. Springer, Heidelberg (2016). doi:10.1007/978-3-662-53132-7_14
Endrullis, J., Klop, J.W., Saarela, A., Whiteland, M.: Degrees of transducibility. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 1–13. Springer, Cham (2015). doi:10.1007/978-3-319-23660-5_1
Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992). doi:10.1007/BFb0023844
Sakarovitch, J.: Elements of automata theory. Cambridge University Press, Cambridge (2009)
Zantema, H., Bosma, W.: Extended version of this paper (2017). http://www.win.tue.nl/~hzantema/permtr.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zantema, H., Bosma, W. (2017). Classifying Non-periodic Sequences by Permutation Transducers. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-62809-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62808-0
Online ISBN: 978-3-319-62809-7
eBook Packages: Computer ScienceComputer Science (R0)