Classifying non-periodic sequences by permutation transducers

H. Zantema, W. Bosma

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelDevelopments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings
RedacteurenEmilie Charlier, Julien Leroy, Michel Rigo
Plaats van productieCham
UitgeverijSpringer
Pagina's365-377
Aantal pagina's13
ISBN van elektronische versie978-3-319-62809-7
ISBN van geprinte versie978-3-319-62808-0
DOI's
StatusGepubliceerd - 2017

Publicatie series

NaamLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10396 LNCS
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Vingerafdruk Duik in de onderzoeksthema's van 'Classifying non-periodic sequences by permutation transducers'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    Zantema, H., & Bosma, W. (2017). Classifying non-periodic sequences by permutation transducers. In E. Charlier, J. Leroy, & M. Rigo (editors), Developments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings (blz. 365-377). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10396 LNCS). Springer. https://doi.org/10.1007/978-3-319-62809-7_28