{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:03:16Z","timestamp":1767927796120,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319731162","type":"print"},{"value":"9783319731179","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_30","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:45:34Z","timestamp":1513874734000},"page":"428-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Theoretical Aspects of Symbolic Automata"],"prefix":"10.1007","author":[{"given":"Hellis","family":"Tamm","sequence":"first","affiliation":[]},{"given":"Margus","family":"Veanes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Tamm, H.: Theory of \u00e1tomata. Theor. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR2","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata, MRI Symposia Series, vol. 12, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn, NY (1963)"},{"issue":"4","key":"30_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-63387-9_3","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2017","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: Minimization of symbolic automata. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 541\u2013554 (2014)","DOI":"10.1145\/2535838.2535849"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: Forward bisimulations for nondeterministic symbolic finite automata. In: Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, ETAPS 2017, Proceedings, Part I, Uppsala, Sweden, 22\u201329 April 2017, pp. 518\u2013534 (2017)","DOI":"10.1007\/978-3-662-54577-5_30"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","volume":"51","author":"F Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Informaticae 51, 339\u2013368 (2002)","journal-title":"Fund. Informaticae"},{"issue":"2","key":"30_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.tcs.2003.11.008","volume":"313","author":"F Denis","year":"2004","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2), 267\u2013294 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Drews","year":"2017","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ipl.2016.01.003","volume":"116","author":"S Iv\u00e1n","year":"2016","unstructured":"Iv\u00e1n, S.: Complexity of atoms, combinatorially. Inf. Process. Lett. 116, 356\u2013360 (2016)","journal-title":"Inf. Process. Lett."},{"key":"30_CR11","unstructured":"Keil, M., Thiemann, P.: Symbolic solving of extended regular expression inequalities. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, 15\u201317 December 2014, New Delhi, India, pp. 175\u2013186 (2014)"},{"issue":"2","key":"30_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Programm. 19(2), 173\u2013190 (2009)","journal-title":"J. Funct. Programm."},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-19225-3_23","volume-title":"Descriptional Complexity of Formal Systems","author":"H Tamm","year":"2015","unstructured":"Tamm, H.: Generalization of the double-reversal method of finding a canonical residual finite state automaton. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 268\u2013279. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_23"},{"key":"30_CR14","unstructured":"Tamm, H.: New interpretation and generalization of the Kameda-Weiner method. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, pp. 116:1\u2013116:12 (2016)"},{"issue":"6","key":"30_CR15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Veanes, M., de Halleux, P., Tillmann, N.: Rex: symbolic regular expression explorer. In: Third International Conference on Software Testing, Verification and Validation, ICST 2010, pp. 498\u2013507. IEEE Computer Society (2010)","DOI":"10.1109\/ICST.2010.15"},{"key":"30_CR17","unstructured":"Watson, B.W.: A taxonomy of finite automata construction algorithms. Computing science report 93\/43. Eindhoven University of Technology (1995)"},{"key":"30_CR18","unstructured":"Watson, B.W.: Implementing and using finite automata toolkits. In: Extended finite state models of language, pp. 19\u201336. Cambridge University Press (1999)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T03:42:23Z","timestamp":1751168543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}