{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:19:14Z","timestamp":1725484754627},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_24","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T23:45:05Z","timestamp":1180223105000},"page":"274-288","source":"Crossref","is-referenced-by-count":1,"title":["Supernondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Lynette","family":"van Zijl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J.A. Brzozowski","year":"1980","unstructured":"J.A. Brzozowski and E. Leiss, On Equations for Regular Languages, Finite Automata, and Sequential Networks. Theoretical Computer Science 10 (1980) 19\u201335.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation. Journal of the ACM 28 (1981) 114\u2013133.","journal-title":"Journal of the ACM"},{"key":"24_CR3","volume-title":"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."},{"key":"24_CR4","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) 323\u2013330.","journal-title":"Theoretical Computer Science"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(85)90215-4","volume":"38","author":"E. Leiss","year":"1985","unstructured":"E. Leiss, Succinct Representation of Regular Languages by Boolean Automata II. Theoretical Computer Science 38 (1985) 133\u2013136.","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","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, 188\u2013191.","DOI":"10.1109\/SWAT.1971.11"},{"key":"24_CR7","unstructured":"L. van Zijl, Generalized Nondeterminism and the Succinct Representation of Regular Languages. PhD dissertation, Stellenbosch University, March 1997. \n                  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-36390-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:54:46Z","timestamp":1550361286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}