A3 Vertaisarvioitu kirjan tai muun kokoomateoksen osa
Regularity of k-Abelian equivalence classes of fixed cardinality
Tekijät: Karhumäki Juhani, Whiteland Markus A.
Toimittaja: Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
Kustantaja: Springer Verlag
Julkaisuvuosi: 2018
Kokoomateoksen nimi: Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday
Tietokannassa oleva lehden nimi: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Sarjan nimi: Lecture Notes in Computer Science
Vuosikerta: 11011
Aloitussivu: 49
Lopetussivu: 62
ISBN: 978-3-319-98354-7
eISBN: 978-3-319-98355-4
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-319-98355-4_4
Two words u and v are said to be k-Abelian equivalent if, for each word x of length at most k, the number of occurrences of x as a factor of u is the same as for v. In this note we continue the analysis of k-Abelian equivalence classes. In particular, we show that, for any fixed integer r≥1" role="presentation">r≥1, the language of words representing equivalence classes of cardinality r is regular.