{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:24Z","timestamp":1725888984522},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_20","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"250-261","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of Unary SV-XNFA with Different Acceptance Conditions"],"prefix":"10.1007","author":[{"given":"Laurette","family":"Marais","sequence":"first","affiliation":[]},{"given":"Lynette","family":"van Zijl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-41114-9_14","volume-title":"Descriptional Complexity of Formal Systems","author":"L Marais","year":"2016","unstructured":"Marais, L., Zijl, L.: Unary self-verifying symmetric difference automata. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 180\u2013191. Springer, Cham (2016). doi:\n10.1007\/978-3-319-41114-9_14"},{"key":"20_CR2","volume-title":"Discrete Mathematical Structures and their Applications","author":"HS Stone","year":"1973","unstructured":"Stone, H.S.: Discrete Mathematical Structures and their Applications. Science Research Associates, Chicago (1973)"},{"key":"20_CR3","unstructured":"Van Zijl, L.: Nondeterminism and succinctly representable regular languages. In: Proceedings of the 2002 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists. SAICSIT 2002, Republic of South Africa, South African Institute for Computer Scientists and Information Technologists, pp. 212\u2013223 (2002)"},{"issue":"3","key":"20_CR4","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ic.2010.11.017","volume":"209","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209(3), 528\u2013535 (2011). Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009)","journal-title":"Inf. Comput."},{"key":"20_CR5","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. 5642, pp. 24\u201333. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-02979-0_6"},{"key":"20_CR6","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","year":"2012","unstructured":"Merwe, B., Tamm, H., Zijl, L.: Minimal DFA for symmetric difference NFA. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 307\u2013318. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-31623-4_24"},{"key":"20_CR7","unstructured":"Van der Merwe, B.: Private communication (2017)"},{"key":"20_CR8","volume-title":"Applied Modern Algebra","author":"LL Dornhoff","year":"1978","unstructured":"Dornhoff, L.L., Hohn, F.E.: Applied Modern Algebra. Macmillan Publishing Co., Inc., London (1978)"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"RJ McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers, vol. 23. Springer Science & Business Media, Berlin (1987)"}],"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-319-60252-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:03:34Z","timestamp":1496401414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}