{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:07Z","timestamp":1725490567201},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_28","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"318-326","source":"Crossref","is-referenced-by-count":2,"title":["The MERLin Environment Applied to \u22c6-NFAs"],"prefix":"10.1007","author":[{"given":"Lynette","family":"van Zijl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John-Paul","family":"Harper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Olivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"28_CR1","unstructured":"T.L. Stirling et al, How to Build a Beowulf: A Guide to the Implementation and Application of PC Clusters. MIT Press, Scientific and Engineering Computation Series, 1999."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"M. Chrobak, Finite Automata and Unary Languages. Theoretical Computer Science 47(1986), pp. 149\u2013158.","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","volume-title":"Applied Modern Algebra","author":"L.L. Dornhoff","year":"1977","unstructured":"L.L. Dornhoff and F.E. Hohn, Applied Modern Algebra. MacMillan Publishing Co., Inc., New York, 1977."},{"key":"28_CR4","unstructured":"S.W. Golomb, Shift Register Sequences. Holden-Day, Inc., 1967."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel, Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8(1987), pp. 231\u2013274.","journal-title":"Science of Computer Programming"},{"key":"28_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Massachusetts, 1979."},{"issue":"213","key":"28_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-96-00696-5","volume":"65","author":"P. L\u2019Ecuyer","year":"1996","unstructured":"P. L\u2019Ecuyer, Maximally Equidistributed Combined Tausworthe Generators. Mathematics of Computation 65(213):203\u2013213, 1996.","journal-title":"Mathematics of Computation"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"P. L\u2019Ecuyer, Testing Random Number Generators. Proceedings of the 1992 Winter Simulation Conference, IEEE Press, Dec. 1992, pp.305\u2013313.","DOI":"10.1145\/167293.167354"},{"key":"28_CR9","unstructured":"K. Mehlhorn et al, The LEDA User Manual Version 4.0. Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany. http:\/\/www.mpi-sb.mpg.de\/LEDA"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"E. Leiss, Succinct Representation of Regular Languages by Boolean Automata. Theoretical Computer Science 13 (1981), pp. 323\u2013330.","journal-title":"Theoretical Computer Science"},{"key":"28_CR11","unstructured":"T.K.S. Leslie, Efficient Approaches to Subset Construction. MSc Thesis, University of Waterloo, Waterloo, Canada, 1994."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"A.R. Meyer and M.J. Fischer, Economy of Description by Automata, Grammars, and Formal Systems. Proc. of the 12th Annual IEEE Symposium on Switching and Automata Theory, October 1971, Michigan, pp. 188\u2013191.","DOI":"10.1109\/SWAT.1971.11"},{"key":"28_CR13","unstructured":"D. Raymond and D. Wood, The User\u2019s Guide to Grail. University of Waterloo, Waterloo, Canada, 1995. http:\/\/www.csd.uwo.ca\/research\/grail"},{"key":"28_CR14","unstructured":"A.P.J. van der Walt and L. van Zijl, \u22c6-Realizations of Deterministic Finite Automata. British Colloquium for Theoretical Computer Science 11, Swansea, Wallis, April 1995."},{"key":"28_CR15","unstructured":"L. van Zijl, Generalized Nondeterminism and the Succinct Representation of Regular Languages. PhD dissertation, Stellenbosch University, March 1997. http:\/\/www.cs.sun.ac.za\/~lynette\/boek.ps.gz"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:06:12Z","timestamp":1556802372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}