The following pages link to Reconstruction of sequences (Q1182969):
Displaying 26 items.
- Reconstruction of a word from a multiset of its factors (Q930915) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- On highly palindromic words (Q1028422) (← links)
- On a reconstruction problem for sequences (Q1352885) (← links)
- Reconstructing sequences (Q1377760) (← links)
- Reconstruction from subsequences. (Q1406745) (← links)
- Order of weak \(M\)-relation and Parikh matrices (Q1659987) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length (Q2155320) (← links)
- Phase transition in sequence unique reconstruction (Q2461328) (← links)
- Independence of certain quantities indicating subword occurrences (Q2508977) (← links)
- Separability of \(M\)-equivalent words by morphisms (Q2806556) (← links)
- (Q3198925) (← links)
- (Q4570859) (← links)
- Reconstruction of Sequences Over Non-Identical Channels (Q4615389) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Sequence Reconstruction for Limited-Magnitude Errors (Q5088564) (← links)
- (Q5109061) (← links)
- Freeness Problem for Matrix Semigroups of Parikh Matrices (Q5164864) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Efficient reconstruction of sequences from their subsequences of supersequences (Q5930025) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Reconstruction of hypermatrices from subhypermatrices (Q6637145) (← links)
