
- 1 FRANKLIN, J . N. Deterministic simulation of random processes. Math. Comput. 17 (1963), 28-57.Google Scholar
- 2 KNUTH, D .E . Construction of a random sequence. BIT 5, 4 (1965), 246-250.Google Scholar
- 3 NIVEN, I. Irrational Numbers. Carus Mathematical Monographs, Mathematical Association of America, Washington, D.C., 1956.Google Scholar
- 4 WEYL, H. ~ber die Gleichverteilung von Zahlen mod. Eins. Math. Ann. 77 (1916), 313-352.Google Scholar
- 5 COPELAND, A. H., AND ERDOS, P. Note on normal numbers. Bull. Amer. Math. Soc. 58 (1946), 857-860.Google Scholar
Index Terms
Sequences of Numbers That Are Approximately Completely Equidistributed
Recommendations
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
SEFM '09: Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal MethodsMethods for testing from Finite State Machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these ...
Using distinguishing and UIO sequences together in a checking sequence
TestCom'06: Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating SystemsIf a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence $\bar{D}$ , then there are methods that make ...
Morphic words and equidistributed sequences
AbstractThe problem we consider is the following: Given an infinite word w on an ordered alphabet, construct the sequence ν w = ( ν [ n ] ) n, equidistributed on [ 0 , 1 ] and such that ν [ m ] < ν [ n ] if and only if σ m ( w ) < σ n ( w ), ...






Comments