{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:28:06Z","timestamp":1743067686187,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411132"},{"type":"electronic","value":"9783319411149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-41114-9_14","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T10:05:14Z","timestamp":1467021914000},"page":"180-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unary Self-verifying Symmetric Difference Automata"],"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":[[2016,6,28]]},"reference":[{"key":"14_CR1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1990","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)","edition":"1"},{"key":"14_CR2","unstructured":"Van Zijl, L.: Generalized nondeterminism and the succinct representation of regular languages. Ph.D. thesis, University of Stellenbosch (1997). \n                    http:\/\/www.cs.sun.ac.za\/~lvzijl\/publications\/boek.ps.gz"},{"key":"14_CR3","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 Van der Merwe","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. 7386, pp. 307\u2013318. Springer, Heidelberg (2012)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1051\/ita:2007017","volume":"41","author":"I Assent","year":"2007","unstructured":"Assent, I., Seibert, S.: An upper bound for transforming self-verifying automata into deterministic ones. RAIRO-Theoretical Informatics and Applications-Informatique Th\u00e9orique et Applications 41(3), 261\u2013265 (2007)","journal-title":"RAIRO-Theoretical Informatics and Applications-Informatique Th\u00e9orique et Applications"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48523-6_40","volume-title":"Automata, Languages and Programming","author":"J Hromkovi\u010d","year":"1999","unstructured":"Hromkovi\u010d, J., Schnitger, G.: On the power of Las Vegas II. Two-way finite automata. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 433\u2013442. Springer, Heidelberg (1999)"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","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":"14_CR7","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)"},{"key":"14_CR8","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":"14_CR9","volume-title":"Applied Modern Algebra","author":"LL Dornhoff","year":"1978","unstructured":"Dornhoff, L.L., Hohn, F.E.: Applied Modern Algebra. Macmillan Publishing Co., Inc., Collier Macmillan Publishers, New York, London (1978)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00453-010-9479-9","volume":"63","author":"V Geffert","year":"2010","unstructured":"Geffert, V., Pighizzini, G.: Pairs of complementary unary languages with \u201cbalanced\u201d nondeterministic automata. Algorithmica 63(3), 571\u2013587 (2010)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41114-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:03:07Z","timestamp":1594598587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41114-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411132","9783319411149"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41114-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}