Recurrent Partial Words and Representable Sets.

DOI10.25596/JALC-2016-149zbMATH Open1380.68318OpenAlexW2604132601MaRDI QIDQ5267519FDOQ5267519

Bob Chen, Jarett Schwartz, Sinziana Munteanu, F. Blanchet-Sadri, Slater Stich, Aleksandar Chakarov, Lucas Manuelli

Publication date: 13 June 2017

Full work available at URL: https://doi.org/10.25596/jalc-2016-149

zbMATH Keywords

combinatorics on wordsformal languagesrecurrencepartial wordssubword complexityrepresentable sets

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Recurrent words with constant abelian complexity 👍 👎
• Partial words and a theorem of Fine and Wilf revisited 👍 👎
• A periodicity lemma for partial words 👍 👎
• Unavoidable sets of partial words 👍 👎
• Periodicity properties on partial words 👍 👎
• On sets of indefinitely desubstitutable words 👍 👎
• On universal partial words for word-patterns and set partitions 👍 👎
• Recurrent partial words 👍 👎

This page was built for publication: Recurrent Partial Words and Representable Sets.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267519)