Reconstructing Words from Right-Bounded-Block Words

DOI10.1007/978-3-030-48516-0_8OpenAlexW3028764859MaRDI QIDQ5041252

Florin Manea, Dirk Nowotka, Pamela Fleischmann, Marie Lejeune, Michel Rigo

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the number of distinct \(k\)-decks: enumeration and bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another generalization of abelian equivalence: binomial complexity of infinite words
• A congruence theorem for trees
• Subwords in reverse-complement order
• Reconstruction of sequences
• On a reconstruction problem for sequences
• Reconstruction from subsequences.
• Reconstructing words from subwords in linear time
• Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
• On Reconstruction of Matrices
• Leaf-Reconstructibility of Phylogenetic Networks
• Fine-Grained Complexity Theory (Tutorial)
• Ulam's Conjecture and Graph Reconstructions