{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:41Z","timestamp":1750221041589,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T00:00:00Z","timestamp":1537920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,26]]},"DOI":"10.1145\/3278681.3278684","type":"proceedings-article","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T13:05:43Z","timestamp":1541768743000},"page":"20-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The state complexity of language operations on XNFA-succinct unary regular languages"],"prefix":"10.1145","author":[{"given":"Laurette","family":"Marais","sequence":"first","affiliation":[{"name":"Meraka Institute and Stellenbosch University, South Africa"}]},{"given":"Lynette","family":"van Zijl","sequence":"additional","affiliation":[{"name":"Stellenbosch University, South Africa"}]}],"member":"320","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90160-U"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/21559.21563"},{"volume-title":"Applied Modern Algebra","author":"Dornhoff L L","key":"e_1_3_2_1_3_1","unstructured":"L L Dornhoff and F E Hohn . 1978. Applied Modern Algebra . Macmillan Publishing Co., Inc. L L Dornhoff and F E Hohn. 1978. Applied Modern Algebra. Macmillan Publishing Co., Inc."},{"volume-title":"Shift Register Sequences","author":"Golomb Solomon W.","key":"e_1_3_2_1_4_1","unstructured":"Solomon W. Golomb . 1981. Shift Register Sequences . Aegean Park Press . Solomon W. Golomb. 1981. Shift Register Sequences. Aegean Park Press."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103002199"},{"key":"e_1_3_2_1_6_1","volume-title":"Ullman","author":"Hopcroft John E.","year":"1990","unstructured":"John E. Hopcroft and Jeffrey D . Ullman . 1990 . Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. John E. Hopcroft and Jeffrey D. Ullman. 1990. Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01039-X"},{"volume-title":"Algebraic Combinatorics on Words. Encyclopedia of mathematics and its applications","author":"Lothaire Monsieur","key":"e_1_3_2_1_8_1","unstructured":"Monsieur Lothaire . 2002. Algebraic Combinatorics on Words. Encyclopedia of mathematics and its applications , Vol. 90 . Cambridge University Press . Monsieur Lothaire. 2002. Algebraic Combinatorics on Words. Encyclopedia of mathematics and its applications, Vol. 90. Cambridge University Press."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41114-9_14"},{"key":"e_1_3_2_1_10_1","unstructured":"Harold S Stone. 1973. Discrete Mathematical Structures and their Applications. Science Research Associates Chicago.  Harold S Stone. 1973. Discrete Mathematical Structures and their Applications. Science Research Associates Chicago."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.019"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 2002 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists. ACM, Republic of South Africa, 212--223","author":"van Zijl Lynette","year":"2002","unstructured":"Lynette van Zijl . 2002 . 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. ACM, Republic of South Africa, 212--223 . Lynette van Zijl. 2002. 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. ACM, Republic of South Africa, 212--223."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647268.721718"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1993-1155576-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)00011-F"}],"event":{"name":"SAICSIT '18: 2018 Annual Conference of the South African Institute of Computer Scientists and Information Technologists","acronym":"SAICSIT '18","location":"Port Elizabeth South Africa"},"container-title":["Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3278681.3278684","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3278681.3278684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:54Z","timestamp":1750207434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3278681.3278684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":15,"alternative-id":["10.1145\/3278681.3278684","10.1145\/3278681"],"URL":"https:\/\/doi.org\/10.1145\/3278681.3278684","relation":{},"subject":[],"published":{"date-parts":[[2018,9,26]]},"assertion":[{"value":"2018-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}