{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:58:59Z","timestamp":1725890339927},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_24","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:03:34Z","timestamp":1341810214000},"page":"307-318","source":"Crossref","is-referenced-by-count":5,"title":["Minimal DFA for Symmetric Difference NFA"],"prefix":"10.1007","author":[{"given":"Brink","family":"van der Merwe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hellis","family":"Tamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lynette","family":"van Zijl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on the Mathematical Theory of Automata. MRI Symposia Series, pp. 529\u2013561. Polytechnic Press of Polytechnic Institute of Brooklyn (1963)","key":"24_CR1"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-22321-1_10","volume-title":"Developments in Language Theory","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00c1tomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 105\u2013116. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Tamm, H.: Quotient complexities of atoms of regular languages. In: Proceedings of the 16th International Conference on Developments in Language Theory (DLT). Springer (August 2012)","key":"24_CR3","DOI":"10.1007\/978-3-642-31653-1_6"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44693-1_13","volume-title":"STACS 2001","author":"F. Denis","year":"2001","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual Finite State Automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 144\u2013157. Springer, Heidelberg (2001)"},{"unstructured":"Dornhoff, L., Hohn, F.: Applied Modern Algebra. Macmillan Publishing Company (1978)","key":"24_CR5"},{"doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated (2009)","key":"24_CR6","DOI":"10.1007\/978-3-642-01492-5"},{"key":"24_CR7","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)"},{"unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison Wesley (1979)","key":"24_CR8"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-27812-2_11","volume-title":"Theory Is Forever","author":"L. Ilie","year":"2004","unstructured":"Ilie, L., Navarro, G., Yu, S.: On NFA Reductions. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Salomaa Festschrift. LNCS, vol.\u00a03113, pp. 112\u2013124. Springer, Heidelberg (2004)"},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2\/3","key":"24_CR11","first-page":"287","volume":"10","author":"D. Kirsten","year":"2005","unstructured":"Kirsten, D., M\u00e4urer, I.: On the determinization of weighted automata. Journal of Automata, Languages and Combinatorics\u00a010(2\/3), 287\u2013312 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2","key":"24_CR12","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"unstructured":"Stone, H.: Discrete Mathematical Structures. Science Research Associates (1973)","key":"24_CR13"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-23283-1_17","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"B. Merwe van der","year":"2011","unstructured":"van der Merwe, B., van Zijl, L., Geldenhuys, J.: Ambiguity of Unary Symmetric Difference NFAs. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol.\u00a06916, pp. 256\u2013266. Springer, Heidelberg (2011)"},{"unstructured":"Van Zijl, L.: Generalized Nondeterminism and the Succinct Representation of Regular Languages. Ph.D. thesis, Stellenbosch University (November 1997)","key":"24_CR15"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.tcs.2004.07.012","volume":"328","author":"L. Van Zijl","year":"2004","unstructured":"Van Zijl, L.: On binary symmetric difference NFAs and succinct representations of regular languages. Theoretical Computer Science\u00a0328(1), 161\u2013170 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:49:17Z","timestamp":1556927357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}