Skip to main content
SpringerLink
Log in

Random Number Generation with ⊕-NFAs

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2494))

Included in the following conference series:

Abstract

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.

This research was supported by grants from the University of Stellenbosch.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Culik II, K., Kari, J.: Image Compression using Weighted Finite Automata. Computer and Graphics 17 (1993) 305–313.

    Article  Google Scholar 

  2. De Villiers, H.B., Engelmohr, J., Raitt, L., Wedlake, R.: The MER-Lin User’s Manual, Technical Report, Stellenbosch University, March 2001. http://www.cs.sun.ac.za/projects/techreports

  3. Dornhoff, L.L., Hohn, F. E.: Applied Modern Algebra. MacMillan Publishing Co., Inc., New York, 1977.

    Google Scholar 

  4. Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York, 1974.

    MATH  Google Scholar 

  5. Golomb, S.W.: Shift Register Sequences. Holden-Day, Inc., 1967.

    Google Scholar 

  6. L’Ecuyer, P.: Maximally Equidistributed Combined Tausworthe Generators. Mathematics of Computation 65 (1996) 203–213.

    Article  MATH  MathSciNet  Google Scholar 

  7. L’Ecuyer, P.: Tables of Maximally-Equidistributed Combined LFSR Generators. Manuscript. http://www.iro.umontreal.ca/~lecuyer

  8. L’Ecuyer, P.: Testing Random Number Generators. Proceedings of the 1992 Winter Simulation Conference, IEEE Press, Dec. 1992, 305–313.

    Google Scholar 

  9. Leslie, T. K.S.: Efficient Approaches to Subset Construction. MSc Thesis, University of Waterloo, Waterloo, Canada, 1994.

    Google Scholar 

  10. Salomaa, A.: Public-Key Cryptography. Springer-Verlag, Berlin, 1990.

    MATH  Google Scholar 

  11. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, 1997.

    Google Scholar 

  12. Van derWalt, A., Van Zijl, L.: *-Realizations of Deterministic Finite Automata. British Colloquium for Theoretical Computer Science 11, Swansea, Wallis, April 1995.

    Google Scholar 

  13. Van Zijl, L.: Generalized Nondeterminism and the Succinct Representation of Regular Languages. Ph.D. dissertation, Stellenbosch University, March 1997.

    Google Scholar 

  14. Van Zijl, L., Van der Walt, A. P. J.: Some Automata-Theoretic Properties of ∩-NFAs. South African Computer Journal 24 (1999) 163–167.

    Google Scholar 

  15. Van Zijl, L., Harper, J.-P., Olivier, F.: The MERLin Environment Applied to *-NFAs. Proceedings of the CIAA2000, London, Ontario, Canada, July 2000. To appear in Lecture Notes in Computer Science 2088 (2001).

    Google Scholar 

  16. Wolfram, S.: Cellular Automata and Complexity. Addison-Wesley, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stellenbosch University, South Africa

    Lynette van Zijl

Authors
  1. Lynette van Zijl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Pretoria, Lynwood Road, Pretoria, 0002, South Africa

    Bruce W. Watson

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong

    Derick Wood

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Zijl, L. (2002). Random Number Generation with ⊕-NFAs. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-36390-4_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00400-4

  • Online ISBN: 978-3-540-36390-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation