Separating many words by counting occurrences of factors

DOI10.1007/978-3-030-24886-4_19zbMath1497.68278arXiv1905.07223OpenAlexW2966724346MaRDI QIDQ2327561

Aleksi Saarela

Publication date: 15 October 2019

Full work available at URL: https://arxiv.org/abs/1905.07223

zbMATH Keywords

regular languageinfinite wordcombinatorics on words\(k\)-abelian equivalenceseparating words problem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (2)

Counting subwords in circular words and their Parikh matrices ⋮ Separating the Words of a Language by Counting Factors

This page was built for publication: Separating many words by counting occurrences of factors