{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:49:00Z","timestamp":1725486540358},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666523"},{"type":"electronic","value":"9783540480570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48057-9_5","type":"book-chapter","created":{"date-parts":[[2007,6,23]],"date-time":"2007-06-23T11:05:18Z","timestamp":1182596718000},"page":"57-68","source":"Crossref","is-referenced-by-count":2,"title":["Determinization of Glushkov Automata"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Luc","family":"Ponty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"key":"5_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V. Antimirov","year":"1996","unstructured":"V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291\u2013319, 1996.","journal-title":"Theoret. Comput. Sci"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoret. Comput. Sci. to appear.","DOI":"10.1016\/S0304-3975(97)00296-X"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","volume":"12","author":"J.-M. Champarnaud","year":"1991","unstructured":"J.-M. Champarnaud and G. Hansel. Automate, a computing package for automata and finite semigroups. J. Symbolic Comput., 12:197\u2013220, 1991.","journal-title":"J. Symbolic Comput."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"M.D. Davis, R. Sigal, and E.J. Weyuker. Computability, Complexity, and Languages, Fundamentals of Theoretical Computer Science. Academic Press, 1994.","DOI":"10.1016\/B978-0-08-050246-5.50020-9"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V. M. Glushkov","year":"1961","unstructured":"V. M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1\u201353, 1961.","journal-title":"Russian Mathematical Surveys"},{"key":"5_CR7","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, MA, 1979."},{"key":"5_CR8","volume-title":"A program for computing finite automata","author":"J. H. Johnson","year":"1986","unstructured":"J. H. Johnson. A program for computing finite automata. Unpublished Report, University of Waterloo, Canada, 1986."},{"key":"5_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-63174-7_6","volume-title":"Automata Implementation: First International Workshop on Implementing Automata, WIA\u201996","author":"J. H. Johnson","year":"1997","unstructured":"J. H. Johnson and D. Wood. Instruction computation in subset construction. In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation: First International Workshop on Implementing Automata, WIA\u201996, number 1260 in Lecture Notes in Computer Science, pages 64\u201371, London, Ontario, 1997. Springer-Verlag, Berlin."},{"key":"5_CR10","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34:3\u201341, 1956. Princeton U. Press.","journal-title":"Automata Studies"},{"key":"5_CR11","series-title":"Technical Report","volume-title":"Efficient approaches to subset construction","author":"T. K. S. Leslie","year":"1992","unstructured":"T. K. S. Leslie. Efficient approaches to subset construction. Technical Report CS-92-29, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1992."},{"key":"5_CR12","unstructured":"T. K. S. Leslie, D. R. Raymond, and D. Wood. The expected performance of subset construction. non publi\u00e9, 1996."},{"key":"5_CR13","first-page":"1","volume-title":"Handbook of Theoretical Computer Science, Formal Models and Semantics","author":"D. Perrin","year":"1990","unstructured":"D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Formal Models and Semantics, volume B, pages 1\u201357. Elsevier, Amsterdam, 1990."},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BFb0031389","volume-title":"Automata Implementation: Second International Workshop on Implementing Automata, WIA\u201997","author":"J.-L. Ponty","year":"1998","unstructured":"J.-L. Ponty. An efficient null-free procedure for deciding regular language membership. In D. Wood and S. Yu, editors, Automata Implementation: Second International Workshop on Implementing Automata, WIA\u201997, number 1436 in Lecture Notes in Computer Science, pages 159\u2013170, London, Ontario, 1998. Springer-Verlag, Berlin."},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-63174-7_9","volume-title":"Automata Implementation: First International Workshop on Implementing Automata, WIA\u201996","author":"J.-L. Ponty","year":"1997","unstructured":"J.-L. Ponty, D. Ziadi, and J.-M. Champarnaud. A new quadratic algorithm to convert a regular expression into an automaton. In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation: First International Workshop on Implementing Automata, WIA\u201996, number 1260 in Lecture Notes in Computer Science, pages 109\u2013119, London, Ontario, 1997. Springer-Verlag, Berlin."},{"issue":"2","key":"5_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res., 3(2):115\u2013125, 1959.","journal-title":"IBM J. Res"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D. Raymond","year":"1994","unstructured":"D. Raymond and D. Wood. Grail, a C++ library for automata and expressions. J. Symbolic Comput., 17:341\u2013350, 1994.","journal-title":"J. Symbolic Comput"},{"key":"5_CR18","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"D. Wood. Theory of Computation. Wiley, New York, 1987."},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Word, Language, Grammar, pages 41\u2013110. Springer-Verlag, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48057-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T09:21:10Z","timestamp":1556529670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48057-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666523","9783540480570"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48057-9_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}