{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:26Z","timestamp":1771024226643,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631743","type":"print"},{"value":"9783540692058","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63174-7_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:18:18Z","timestamp":1330280298000},"page":"109-119","source":"Crossref","is-referenced-by-count":16,"title":["A new quadratic algorithm to convert a regular expression into an automaton"],"prefix":"10.1007","author":[{"given":"J. -L.","family":"Ponty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -M.","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"9_CR1","volume-title":"Compilers","author":"A. Aho","year":"1986","unstructured":"A. Aho, R. Sethi and J-D. Ullman, Compilers, Addison-Wesley Publishing Company, Inc., Reading, Mass., 1986."},{"key":"9_CR2","volume-title":"Foundations of Computer Science","author":"A. Aho","year":"1992","unstructured":"A. Aho and J.D. Ullman, Foundations of Computer Science, W.H. Freeman and Company, New York, 1992."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0304-3975(95)00104-2","volume":"155","author":"J. Berstel","year":"1996","unstructured":"J. Berstel and J-E. Pin, Local languages and the Berry-Sethi algorithm, Theoretical Computer Science, 155: 439\u2013446, 1996.","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"G. Berry and R. Sethi, From Regular Expression to Deterministic Automata, Theoretical Computer Science, 48: 117\u2013126, 1986.","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","volume-title":"El\u00e9ments d'algorithmique","author":"D. Beauquier","year":"1992","unstructured":"D. Beauquier, J. Berstel et Ph. Chr\u00e9tienne, El\u00e9ments d'algorithmique, Ed. Masson, Paris, 1992."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"A. Br\u00fcggemann-Klein, Regular Expressions into Finite Automata, Theoretical Computer Science, 120: 197\u2013213, 1993.","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","doi-asserted-by":"crossref","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, Journal of Symbolic Computation, 12, 197\u2013220, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"C.H. Chang and R. Paige, From regular expressions to dfa's using compressed nfa's. In Apostolico, Crochemore, Galil and Manber editors, LNCS 644: Combinatorial Pattern Matching, Proceedings, 88\u2013108, Springer Verlag, 1992.","DOI":"10.1007\/3-540-56024-6_8"},{"key":"9_CR9","doi-asserted-by":"crossref","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":"9_CR10","unstructured":"B.W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, CIF-DATA Koninklijke Bibliotheek, Den Haag, Ph. D., Eindhoven University of Technology, 1995."},{"key":"9_CR11","unstructured":"D. Ziadi, Algorithmique parall\u00e8le et s\u00e9quentielle des automates, Th\u00e8se de doctorat, Universit\u00e9 de Rouen, 1996."},{"key":"9_CR12","unstructured":"D. Ziadi and J.-M. Champarnaud, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton, accepted in Theoretical Computer Science, rapport LIR95.10 Informatique Fondamentale, Universit\u00e9 de Rouen, 1995."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63174-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:42:49Z","timestamp":1619559769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63174-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631743","9783540692058"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63174-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}