Reconstructing words from right-bounded-block words

DOI10.1007/978-3-030-48516-0_8MaRDI QIDQ5041252zbMATH OpenOpenAlexFDO

Authors Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, 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)

Recommendations

• Reconstruction of a word from a multiset of its factors
• Word assembly through minimal forbidden words
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
• Reconstructing words from subwords in linear time
• On a reconstruction problem for sequences

Cites work

• A congruence theorem for trees
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Characterization of a word by its subwords
• Fine-Grained Complexity Theory (Tutorial)
• scientific article; zbMATH DE number 417855 (Why is no real title available?)
• scientific article; zbMATH DE number 5604082 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 525969 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• Introduction to algorithms.
• Leaf-reconstructibility of phylogenetic networks
• Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
• On a reconstruction problem for sequences
• On Reconstruction of Matrices
• Reconstructing words from subwords in linear time
• Reconstruction from subsequences.
• Reconstruction of sequences
• Subwords in reverse-complement order
• Ulam's Conjecture and Graph Reconstructions

Cited in

(6)

• \(k\)-spectra of weakly-\(c\)-balanced words
• Scattered Factor-Universality of Words
• On the number of distinct \(k\)-decks: enumeration and bounds
• Reconstructing Words from Right-Bounded-Block Words
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words
• Reconstruction of a word from a multiset of its factors

This page was built for publication: Reconstructing words from right-bounded-block words

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