The structures of bad words
From MaRDI portal
Recommendations
Cites work
- Asymptotic number of isometric generalized Fibonacci cubes
- Fast recognition of Fibonacci cubes
- Generalized Fibonacci cubes
- Generalized fibonacci cubes are mostly hamiltonian
- scientific article; zbMATH DE number 1157214 (Why is no real title available?)
- scientific article; zbMATH DE number 2228553 (Why is no real title available?)
- Linear recognition and embedding of Fibonacci cubes
- On median nature and enumerative properties of Fibonacci-like cubes
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- Proofs of two conjectures on generalized Fibonacci cubes
- Recursive fault-tolerance of Fibonacci cube in hypercubes
- Solution to a conjecture on words that are bad and 2-isometric
- Structure of Fibonacci cubes: a survey
- The degree sequence of Fibonacci and Lucas cubes
- The index of a binary word
- The observability of the Fibonacci and the Lucas cubes
Cited in
(32)- On \(k\)-ary \(n\)-cubes and isometric words
- Words that almost commute
- Quaternary n-cubes and isometric words
- Proof of a conjecture on 2-isometric words
- A negative answer to a problem on generalized Fibonacci cubes
- The self-concatenation of isometric strings is isometric
- All good (bad) words consisting of 5 blocks
- Infinite families of 2-isometric and not 3-isometric binary words
- A characterization of non-isometric binary words
- Checking whether a word is Hamming-isometric in linear time
- All good (bad) words consisting of four blocks.
- Isometric words based on swap and mismatch distance
- Hypercubes and isometric words based on swap and mismatch distance
- Isometric words and edit distance: main notions and new variations
- Density of k-ary words with 0, 1, 2-error overlaps
- Partial cubes and Fibonacci dimension: insights and perspectives
- Characterization of isometric words based on swap and mismatch distance
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
- On the necessity of some topological spaces
- Computing the index of non-isometric k-ary words with Hamming and Lee distance
- Isometric sets of words and generalizations of the Fibonacci cubes
- The index of a binary word
- Circular embeddability of isometric words
This page was built for publication: The structures of bad words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326667)
