Public-key cryptography
Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Shift Register Sequences
The MERLin Environment Applied to *-NFAs
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Minimization of unary symmetric difference NFAs
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
On binary ⊕-NFAs and succinct descriptions of regular languages
Theoretical Computer Science - Implementation and application of automata
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Magic numbers for symmetric difference NFAs
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We prove that unary symmetric difference nondeterministic finite automata have the same state cycle as linear feedback shift registers. This leads to the application of these automata for random number generation.