Normal Recurring Decimals
From MaRDI portal
Cited in
(57)- Cellular automata between sofic tree shifts
- Construction of a random sequence
- On encodings of spanning trees
- Serial unblocked designs balanced for correlation between neighbours
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- Maximal state complexity and generalized de Bruijn words
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Towards a theory of patches
- Consensus on de Bruijn graphs
- The degree-diameter problem for sparse graph classes
- Normality and finite-state dimension of Liouville numbers
- A class of nonlinear de Bruijn cycles
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Discrepancy bounds for normal numbers generated by necklaces in arbitrary base
- Nonarchimedean quadratic Lagrange spectra and continued fractions in power series fields
- Normal numbers and completeness results for difference sets
- Repeated games with \(M\)-period bounded memory (pure strategies)
- The combinatorics of N. G. de Bruijn
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
- An alternative construction of normal numbers
- The origins of combinatorics on words
- Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm
- On the complexities of de-Bruijn sequences
- On covering by translates of a set
- On the prevalence of the periodicity of maximizing measures
- Games on deBruijn graphs and cycle means
- Simulating finite automata with context-free grammars.
- Generalized de Bruijn graphs
- On extending de Bruijn sequences
- Test sequence construction using minimum information on the tested system
- On the maximum number of distinct factors of a binary string
- On free spectra of locally testable semigroup varieties
- Decoding perfect maps
- Generalized de Bruijn graphs
- Circulant Boolean relation matrices
- Efficient experimental plans for second-order event-related functional magnetic resonance imaging
- On a combinatorial problem of Good
- Random Generators and Normal Numbers
- On the de Bruijn torus problem
- The enumeration of shift register sequences
- A new look at the de Bruijn graph
- Computation theory of cellular automata
- Reconstructing strings from substrings (Extended abstract)
- Long-term memory modules
- de Bruijn sequences and de Bruijn graphs for a general language
- On ideal t-tuple distribution of filtering de Bruijn sequence generators
- On Eulerian circuits and words with prescribed adjacency patterns
- Independently prescribable sets of n-letter words
- Growing perfect cubes
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
- Strongly connected multivariate digraphs
- Clustering of periodic orbits and ensembles of truncated unitary matrices
- Random walks on semaphore codes and delay de Bruijn semigroups
- Translation invariant extensions of finite volume measures
This page was built for publication: Normal Recurring Decimals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5834368)