Normal Recurring Decimals
From MaRDI portal
Publication:5834368
DOI10.1112/jlms/s1-21.3.167zbMath0060.02702OpenAlexW2019338982MaRDI QIDQ5834368
Publication date: 1946
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-21.3.167
Related Items
Independently prescribable sets of n-letter words, Normality and finite-state dimension of Liouville numbers, On the maximum number of distinct factors of a binary string, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences, Reconstructing strings from substrings (Extended abstract), Circulant Boolean relation matrices, On a combinatorial problem of Good, The origins of combinatorics on words, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, Unnamed Item, Construction of a random sequence, Cellular automata between sofic tree shifts, The lexicographically smallest universal cycle for binary strings with minimum specified weight, Towards a theory of patches, Graphs with the unique path property: Structure, cycles, factors, and constructions, Discrepancy bounds for normal numbers generated by necklaces in arbitrary base, On extending de Bruijn sequences, On the prevalence of the periodicity of maximizing measures, On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators, Clustering of periodic orbits and ensembles of truncated unitary matrices, The degree-diameter problem for sparse graph classes, Growing perfect cubes, On encodings of spanning trees, Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm, A new look at the de Bruijn graph, Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs, Strongly connected multivariate digraphs, Translation invariant extensions of finite volume measures, On the de Bruijn torus problem, NORMAL NUMBERS AND COMPLETENESS RESULTS FOR DIFFERENCE SETS, Random walks on semaphore codes and delay de Bruijn semigroups, Generalized de Bruijn graphs, On Eulerian circuits and words with prescribed adjacency patterns, An alternative construction of normal numbers, A class of nonlinear de Bruijn cycles, Consensus on de Bruijn graphs, Generalized de Bruijn graphs, Test sequence construction using minimum information on the tested system, On covering by translates of a set, Nonarchimedean quadratic Lagrange spectra and continued fractions in power series fields, The combinatorics of N. G. de Bruijn, Random Generators and Normal Numbers, ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES, Serial unblocked designs balanced for correlation between neighbours, On the complexities of de-Bruijn sequences, de Bruijn sequences and de Bruijn graphs for a general language, Minimum Eulerian circuits and minimum de Bruijn sequences, Universal cycles of \((n - 1)\)-partitions of an \(n\)-set, Repeated games with \(M\)-period bounded memory (pure strategies), The enumeration of shift register sequences, Long-term memory modules, Simulating finite automata with context-free grammars., Maximal state complexity and generalized de Bruijn words, Decoding perfect maps, Computation theory of cellular automata
