Reconstructing Words from Right-Bounded-Block Words

DOI10.1142/s0129054121420016zbMath1529.68236OpenAlexW3162653447MaRDI QIDQ6169894

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

Publication date: 15 August 2023

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

Full work available at URL: https://doi.org/10.1142/s0129054121420016

zbMATH Keywords

reconstruction problemcombinatorics on wordsright-bounded-block words

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Related Items

Characterizations of families of morphisms and words via binomial complexities ⋮ Nearly \(k\)-universal words -- investigating a part of Simon's congruence ⋮ On Simon's congruence closure of a string

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.
• An improvement of a Borwein-Erdélyi-Kós result
• 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