{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:58:45Z","timestamp":1740095925148,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_37","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T04:07:12Z","timestamp":1363320432000},"page":"419-430","source":"Crossref","is-referenced-by-count":0,"title":["Counting Minimal Symmetric Difference NFAs"],"prefix":"10.1007","author":[{"given":"Brink","family":"van der Merwe","sequence":"first","affiliation":[]},{"given":"Mark","family":"Farag","sequence":"additional","affiliation":[]},{"given":"Jaco","family":"Geldenhuys","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Artin, M.: Algebra, 1st edn. Prentice-Hall, Incorporated (1991)"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM\u00a047(3), 506\u2013530 (2000), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/337244.337257","journal-title":"J. ACM"},{"key":"37_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J. Berstel Jr.","year":"1988","unstructured":"Berstel Jr., J., Reutenauer, C.: Rational series and their languages. Springer-Verlag New York, Inc., New York (1988)"},{"issue":"4","key":"37_CR4","first-page":"469","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Autom. Lang. Comb.\u00a07(4), 469\u2013486 (2002), \n                    \n                      http:\/\/dl.acm.org\/citation.cfm?id=782466.782472","journal-title":"J. Autom. Lang. Comb."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted Automata and Weighted Logics on Infinite Words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"37_CR6","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press (1990)"},{"key":"37_CR7","volume-title":"An Introduction to Formal Languages and Automata","author":"P. Linz","year":"2011","unstructured":"Linz, P.: An Introduction to Formal Languages and Automata, 5th edn. Jones and Bartlett Publishers, Inc., USA (2011)","edition":"5"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-31623-4_24","volume-title":"Descriptional Complexity of Formal Systems","author":"B. Merwe van der","year":"2012","unstructured":"van der Merwe, B., Tamm, H., van Zijl, L.: Minimal DFA for Symmetric Difference NFA. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 307\u2013318. Springer, Heidelberg (2012), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-31623-4"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C. Nicaud","year":"1999","unstructured":"Nicaud, C.: Average State Complexity of Operations on Unary Automata. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 231\u2013240. Springer, Heidelberg (1999), \n                    \n                      http:\/\/dl.acm.org\/citation.cfm?id=645728.667710"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Norman, C.: Finitely Generated Abelian Groups and Similarity of Matrices Over a Field. Springer Undergraduate Mathematics. Springer (2012)","DOI":"10.1007\/978-1-4471-2730-7"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Rosen, M.: Number Theory in Function Fields. Graduate Texts in Mathematics. Springer (2002)","DOI":"10.1007\/978-1-4757-6046-0"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-36390-4_23","volume-title":"Implementation and Application of Automata","author":"L. Zijl Van","year":"2003","unstructured":"Van Zijl, L.: Random Number Generation with \u2295-NFAs. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 263\u2013273. Springer, Heidelberg (2003), \n                    \n                      http:\/\/dl.acm.org\/citation.cfm?id=647268.721718"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-02979-0_6","volume-title":"Implementation and Application of Automata","author":"J. Vuillemin","year":"2009","unstructured":"Vuillemin, J., Gama, N.: Compact Normal Form for Regular Languages as Xor Automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 24\u201333. Springer, Heidelberg (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-02979-0"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:16:15Z","timestamp":1557587775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}