Classifying non-periodic sequences by permutation transducers

Autor: Zantema, H., Bosma, W., Charlier, É., Leroy, J., Rigo, M.
Přispěvatelé: Formal System Analysis, Charlier, É., Leroy, J., Rigo, M., Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands
Jazyk: angličtina
Rok vydání: 2017
Předmět:
Zdroj: Developments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, 365-377
STARTPAGE=365;ENDPAGE=377;TITLE=Developments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings
Charlier, É.; Leroy, J.; Rigo, M. (ed.), Developments in Language Theory: 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, pp. 365-377
Charlier, É.; Leroy, J.; Rigo, M. (ed.), Developments in Language Theory: 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, 365-377. Cham : Springer International Publishing
STARTPAGE=365;ENDPAGE=377;ISSN=0302-9743;TITLE=Charlier, É.; Leroy, J.; Rigo, M. (ed.), Developments in Language Theory: 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings
Developments in Language Theory ISBN: 9783319628080
DLT
ISSN: 0302-9743
Popis: 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.
Databáze: OpenAIRE