On del-robust primitive words

DOI10.1016/j.dam.2016.01.031zbMath1341.68146OpenAlexW2287822509MaRDI QIDQ277635

Kalpesh Kapoor, Ananda Chandra Nayak, Amit Kumar Srivastava

Publication date: 2 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.031

zbMATH Keywords

context-free languagecombinatorics on wordsdel-robustprimitive wordsreflective

Mathematics Subject Classification ID

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

Related Items

Unnamed Item

Cites Work

• Linear-time computation of local periods
• The equation \(a_ M=b^ Nc^ P\) in a free group
• On the robustness of primitive words
• Primitive partial words
• Algorithms on Strings, Trees and Sequences
• Automatic Sequences
• Jewels of Stringology
• DNA Computing
• Count of primitive words
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item