{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:46Z","timestamp":1725492406414},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_25","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"248-254","source":"Crossref","is-referenced-by-count":1,"title":["Star Normal Form, Rational Expressions, and Glushkov WFAs Properties"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marianne","family":"Flouret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","volume-title":"SEA: A symbolic environment for automata theory","author":"P. Andary","year":"1999","unstructured":"P. Andary, P. Caron, J.-M. Champarnaud, G. Duchamp, M. Flouret, and E. Laugerotte. SEA: A symbolic environment for automata theory. In Automata Implementation: Fourth International Workshop on Implementing Automata, WIA\u201999, Lecture Notes in Computer Science, 1999. To be published."},{"key":"25_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":"25_CR3","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"J. Berstel","year":"1988","unstructured":"J. Berstel and C. Reutenauer. Rational series and their languages. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","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. Theoret. Comput. Sci., 120(1):197\u2013213, 1993.","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1137\/S0097539798346676","volume":"30","author":"A. Buchsbaum","year":"2000","unstructured":"A. Buchsbaum, R. Giancarlo, and J. Westbrook. On the determinization of weighted finite automata. SIAM J. Comput., 30(5):1502\u20131531, 2000.","journal-title":"SIAM J. Comput."},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-44674-5_5","volume-title":"Glushkov construction for multiplicities","author":"P. Caron","year":"2001","unstructured":"P. Caron and M. Flouret. Glushkov construction for multiplicities. In Fifth International Conference on Implementation and Application of Automata, CIAA\u201900, volume 2088 of Lecture Notes in Computer Science, pages 67\u201379, London, Ontario, 2001. Springer-Verlag, Berlin."},{"issue":"1\u20132","key":"25_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(97)00296-X","volume":"233","author":"P. Caron","year":"2000","unstructured":"P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1\u20132):75\u201390, 2000.","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR8","volume-title":"Automata, languages and machines","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg. Automata, languages and machines, volume A. Academic Press, New York, 1974."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02531491","volume":"12","author":"V. M. Glushkov","year":"1960","unstructured":"V. M. Glushkov. On a synthesis algorithm for abstract automata. Ukr. Matem. Zhurnal, 12(2):147\u2013156, 1960. In Russian.","journal-title":"Ukr. Matem. Zhurnal"},{"key":"25_CR10","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":"25_CR11","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":"25_CR12","unstructured":"S. Lombardy and J. Sakarovitch. Derivatives of regular expression with multiplicity. Technical Report 2001D001, ENST, Paris, 2001."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. F. McNaughton","year":"1960","unstructured":"R. F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39\u201357, March 1960.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. P. Sch\u00fctzenberger","year":"1961","unstructured":"M. P. Sch\u00fctzenberger. On the definition of a family of automata. Inform. and Control, 4:245\u2013270, 1961.","journal-title":"Inform. and Control"}],"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-44977-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:05:20Z","timestamp":1551045920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}