Recurrence in infinite partial words

DOI10.1016/j.tcs.2013.12.016zbMath1285.68127OpenAlexW2046105901MaRDI QIDQ2637347

Francine Blanchet-Sadri, Sinziana Munteanu, Bob Chen

Publication date: 11 February 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.016

zbMATH Keywords

combinatorics on wordsautomata and formal languagespartial wordsrecurrence functionrecurrence quotientrecurrent words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit values of the recurrence quotient of Sturmian sequences
• Partial words and a theorem of Fine and Wilf
• Recurrent Partial Words
• Relationally Periodic Sequences and Subword Complexity
• Algorithmic Combinatorics on Partial Words

This page was built for publication: Recurrence in infinite partial words