{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:22Z","timestamp":1780994482872,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540590422","type":"print"},{"value":"9783540491750","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_96","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:03Z","timestamp":1330275543000},"page":"455-466","source":"Crossref","is-referenced-by-count":20,"title":["Partial derivatives of regular expressions and finite automata constructions"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Antimirov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"V. M. Antimirov. Partial derivatives of regular expressions and finite automata constructions. Technical report, CRIN, 1994. (Forthcoming).","DOI":"10.1007\/3-540-59042-0_96"},{"key":"40_CR2","first-page":"195","volume-title":"Developments in Language Theory \u2014 At the Crossroads of Mathematics, Computer Science and Biology","author":"V. M. Antimirov","year":"1994","unstructured":"V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions (short version). In G. Rozenberg and A. Salomaa, editors, Developments in Language Theory \u2014 At the Crossroads of Mathematics, Computer Science and Biology, pages 195\u2013209. World Scientific, Singapore, 1994."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions. Theoretical Comput. Sci., 141, 1995. (To appear).","DOI":"10.1016\/0304-3975(95)80024-4"},{"key":"40_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 expressions to deterministic automata. Theoretical Comput. Sci., 48:117\u2013126, 1986.","journal-title":"Theoretical Comput. Sci."},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. A. Brzozowski","year":"1964","unstructured":"J. A. Brzozowski. Derivatives of regular expressions. J. ACM, 11:481\u2013494, 1964.","journal-title":"J. ACM"},{"key":"40_CR6","doi-asserted-by":"crossref","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. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Comput. Sci., 10:19\u201335, 1980.","journal-title":"Theoretical Comput. Sci."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"C.-H. Chang and R. Paige. From regular expressions to DFA's using compressed NFA's. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching. Proceedings., volume 644 of Lecture Notes in Computer Science, pages 88\u2013108. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56024-6_8"},{"key":"40_CR8","unstructured":"J. H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971."},{"issue":"2","key":"40_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/321386.321399","volume":"14","author":"A. Ginzburg","year":"1967","unstructured":"A. Ginzburg. A procedure for checking equality of regular expressions. J. ACM, 14(2):355\u2013362, 1967.","journal-title":"J. ACM"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J. A. Goguen","year":"1992","unstructured":"J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Comput. Sci., 105:217\u2013273, 1992.","journal-title":"Theoretical Comput. Sci."},{"key":"40_CR11","unstructured":"J. A. Goguen and T. Winkler. Introducing OBJ3. Technical Report SRI-CSL-88-9, Computer Science Lab., SRI International, 1988."},{"issue":"1","key":"40_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1142\/S0218196792000062","volume":"2","author":"D. Krob","year":"1992","unstructured":"D. Krob. Differentiation of K-rational expressions. International Journal of Algebra and Computation, 2(1):57\u201387, 1992.","journal-title":"International Journal of Algebra and Computation"},{"key":"40_CR13","volume-title":"On Ground-Reducibility Problem for Word Rewriting Systems with Variables","author":"G. Kucherov","year":"1994","unstructured":"G. Kucherov and M. Rusinowitch. On Ground-Reducibility Problem for Word Rewriting Systems with Variables. In E. Deaton and R. Wilkerson, editors, Proceedings 1994 ACM\/SIGAPP Symposium on Applied Computing, Phoenix (USA), Mar. 1994. ACM-Press."},{"issue":"1","key":"40_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Trans. on Electronic Computers, 9(1):39\u201347, 1960.","journal-title":"IEEE Trans. on Electronic Computers"},{"issue":"3\u20134","key":"40_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.5109\/13383","volume":"22","author":"Y. Mizoguchi","year":"1987","unstructured":"Y. Mizoguchi, H. Ohtsuka, and Y. Kawahara. A symbolic calculus of regular expressions. Bulletin of Informatics and Cybernetics, 22(3\u20134): 165\u2013170, 1987.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"40_CR16","volume-title":"Handbook of Theoretical Computer Science, volume B, chapter 1","author":"D. Perrin","year":"1990","unstructured":"D. Perrin. Finite automata. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 1. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990."},{"issue":"2","key":"40_CR17","doi-asserted-by":"crossref","first-page":"114","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 Journal of Research and Development, 3(2):114\u2013125, Apr. 1959.","journal-title":"IBM Journal of Research and Development"},{"key":"40_CR18","unstructured":"A. Salomaa. Theory of Automata. Pergamon, 1969."},{"issue":"6","key":"40_CR19","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson. Regular expression search algorithms. Communication ACM, 11(6):419\u2013422, 1968.","journal-title":"Communication ACM"},{"key":"40_CR20","volume-title":"A taxonomy of finite automata construction algorithms. Computing Science Note 93\/43","author":"B. W. Watson","year":"1993","unstructured":"B. W. Watson. A taxonomy of finite automata construction algorithms. Computing Science Note 93\/43, Eindhoven University of Technology, The Netherlands, 1993."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:55:03Z","timestamp":1640940903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}