The following pages link to Normal Recurring Decimals (Q5834368):
Displaying 50 items.
- Normality and finite-state dimension of Liouville numbers (Q285510) (← 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)
- Cellular automata between sofic tree shifts (Q393113) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Towards a theory of patches (Q414472) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- Translation invariant extensions of finite volume measures (Q526590) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Long-term memory modules (Q793658) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Growing perfect cubes (Q941376) (← links)
- Consensus on de Bruijn graphs (Q978620) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- The enumeration of shift register sequences (Q1052333) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- Independently prescribable sets of n-letter words (Q1077431) (← links)
- A new look at the de Bruijn graph (Q1199424) (← links)
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs (Q1199445) (← links)
- On Eulerian circuits and words with prescribed adjacency patterns (Q1213887) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Repeated games with \(M\)-period bounded memory (pure strategies) (Q1300377) (← links)
- Decoding perfect maps (Q1321553) (← links)
- On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators (Q1704203) (← links)
- On the complexities of de-Bruijn sequences (Q1836666) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- On extending de Bruijn sequences (Q1944170) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm (Q2242909) (← links)
- On the maximum number of distinct factors of a binary string (Q2366959) (← links)
- On a combinatorial problem of Good (Q2396027) (← links)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
- Clustering of periodic orbits and ensembles of truncated unitary matrices (Q2440353) (← links)
- On encodings of spanning trees (Q2462399) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- On covering by translates of a set (Q3068760) (← links)
- ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES (Q3094646) (← links)
- Circulant Boolean relation matrices (Q4095082) (← links)
- Serial unblocked designs balanced for correlation between neighbours (Q4721453) (← links)
- (Q4986366) (← links)
- Reconstructing strings from substrings (Extended abstract) (Q5060147) (← links)
- Nonarchimedean quadratic Lagrange spectra and continued fractions in power series fields (Q5207325) (← links)
- Construction of a random sequence (Q5345361) (← links)
- Random Generators and Normal Numbers (Q5472048) (← links)
- NORMAL NUMBERS AND COMPLETENESS RESULTS FOR DIFFERENCE SETS (Q5738200) (← links)
- Random walks on semaphore codes and delay de Bruijn semigroups (Q5739483) (← links)
