The following pages link to (Q5834367):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- The complexity of interacting automata (Q267110) (← links)
- Further results on the nonlinearity of maximum-length NFSR feedbacks (Q267785) (← links)
- On the maximum order of graphs embedded in surfaces (Q273165) (← links)
- Normality and finite-state dimension of Liouville numbers (Q285510) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences (Q315651) (← links)
- Survey of DHT topology construction techniques in virtual computing environments (Q350981) (← links)
- Cellular automata between sofic tree shifts (Q393113) (← links)
- Generation of full cycles by a composition of NLFSRs (Q398953) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Towards a theory of patches (Q414472) (← links)
- Spans of preference functions for de Bruijn sequences (Q423901) (← links)
- Radial Moore graphs of radius three (Q427891) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- The adjacency graphs of some feedback shift registers (Q510426) (← links)
- Translation invariant extensions of finite volume measures (Q526590) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants (Q617857) (← links)
- Bounded budget betweenness centrality game for strategic network formations (Q655424) (← links)
- A particular Hamiltonian cycle on middle levels in the De Bruijn digraph (Q658107) (← links)
- The strategic value of recall (Q665106) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- A note on recursive properties of the de Bruijn, Kautz and FFT digraphs (Q673992) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Finite state complexity (Q719308) (← links)
- The Collatz conjecture and de Bruijn graphs (Q740473) (← links)
- Longest subsequences shared by two de Bruijn sequences (Q780381) (← links)
- Long-term memory modules (Q793658) (← links)
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78 (Q831838) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Restricting SBH ambiguity via restriction enzymes (Q876485) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words (Q895104) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
- Growing perfect cubes (Q941376) (← links)
- Playing off-line games with bounded rationality (Q943583) (← links)
- Minimal polynomials of the modified de Bruijn sequences (Q947100) (← links)
- Error correcting sequence and projective de Bruijn graph (Q1015424) (← links)
- Investigating the existence and the regularity of logarithmic Harary graphs (Q1019190) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- On large vertex-symmetric digraphs (Q1024427) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Universal cycles for permutations (Q1044883) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
