Remarks on Privileged Words

DOI10.1142/S0129054116500088zbMath1353.68223arXiv1311.7403MaRDI QIDQ3186046

Jarkko Peltomäki, Amlesh Jayakumar, Michael Forsyth, Jeffrey O. Shallit

Publication date: 8 August 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

context-free languageregular languagelinear-time algorithmprivileged word

Mathematics Subject Classification ID

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

Related Items (4)

Upper bound for the number of closed and privileged words ⋮ A metric characterisation of repulsive tilings ⋮ Improved estimates for the number of privileged words ⋮ Upper bound for the number of privileged words

Cites Work

• Introducing privileged words: privileged complexity of Sturmian words
• A characterization of subshifts with bounded powers
• On palindromic factorization of words
• On the Number of Closed Factors in a Word
• Fast Pattern Matching in Strings
• A helpful result for proving inherent ambiguity

This page was built for publication: Remarks on Privileged Words