Separating the Words of a Language by Counting Factors

DOI10.3233/FI-2021-2047zbMath1497.68279OpenAlexW3181430233MaRDI QIDQ5158654

Aleksi Saarela

Publication date: 25 October 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2021-2047

zbMATH Keywords

regular languageinfinite wordcombinatorics on words\(k\)-abelian equivalence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• Separating strings with small automata
• On the \(k\)-abelian complexity of the Cantor sequence
• Separating many words by counting occurrences of factors
• On growth and fluctuation of \(k\)-abelian complexity
• Separating Regular Languages with First-Order Logic
• Abelian complexity of minimal subshifts
• ON PARTITIONS SEPARATING WORDS
• Generalized Parikh mappings and homomorphisms
• k-Abelian Equivalence and Rationality
• Remarks on Separating Words
• Separating words by occurrences of subwords
• Uniqueness Theorems for Periodic Functions
• Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
• Bounded Regular Sets

This page was built for publication: Separating the Words of a Language by Counting Factors