{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:00Z","timestamp":1760203020130,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030719944"},{"type":"electronic","value":"9783030719951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":81,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a new measure on regular languages: their<jats:italic>nondeterministic syntactic complexity<\/jats:italic>. It is the least degree of any extension of the \u2018canonical boolean representation\u2019 of the syntactic monoid. Equivalently, it is the least number of states of any<jats:italic>subatomic<\/jats:italic>nondeterministic acceptor. It turns out that essentially all previous structural work on nondeterministic state-minimality computes this measure. Our approach rests on an algebraic interpretation of nondeterministic finite automata as deterministic finite automata endowed with semilattice structure. Crucially, the latter form a self-dual category.<\/jats:p>","DOI":"10.1007\/978-3-030-71995-1_23","type":"book-chapter","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T17:03:39Z","timestamp":1616432619000},"page":"448-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nondeterministic Syntactic Complexity"],"prefix":"10.1007","author":[{"given":"Robert S. R.","family":"Myers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Myers, R.S., Urbat, H., Milius, S.: On continuous nondeterminism and state minimality. In: Proc.\u00a030th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX). vol.\u00a0308, pp. 3\u201323 (2014)","DOI":"10.1016\/j.entcs.2014.10.002"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741\u2013765 (1982)","DOI":"10.1145\/322326.322334"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Arbib, M.A., Manes, E.G.: Adjoint machines, state-behavior machines, and duality. Journal of Pure and Applied Algebra 6(3), 313\u2013344 (1975)","DOI":"10.1016\/0022-4049(75)90028-6"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Arbib, M.A., Manes, E.G.: Fuzzy machines in a category. Bulletin of the Australian Mathematical Society 13(2), 169\u2013210 (1975)","DOI":"10.1017\/S0004972700024412"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Backhouse, R.: Factor theory and the unity of opposites. Journal of Logical and Algebraic Methods in Programming 85(5, Part 2), 824\u2013846 (2016)","DOI":"10.1016\/j.jlamp.2016.01.003"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00e1tomata. Theoretical Computer Science 539, 13\u201327 (2014)","DOI":"10.1016\/j.tcs.2014.04.016"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (Oct 1964)","DOI":"10.1145\/321239.321249"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47, 149\u2013158 (1986)","DOI":"10.1016\/0304-3975(86)90142-8"},{"key":"23_CR9","unstructured":"Clemente, L., Mayr, R.: Efficient reduction of nondeterministic automata with application to language inclusion testing. Logical Methods in Computer Science Volume 15, Issue 1 (2019)"},{"key":"23_CR10","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Printed in GB by William Clowes & Sons Ltd (1971)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"De\u00a0Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) Computer Aided Verification. pp. 17\u201330. Springer (2006)","DOI":"10.1007\/11817963_5"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science Dresden, Germany, February 15\u201317, 2001 Proceedings. pp. 144\u2013157. Springer Berlin Heidelberg, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-44693-1_13"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P.: Chrobak normal form revisited, with applications. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.M., Maurel, D. (eds.) Implementation and Application of Automata. pp. 142\u2013153. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22256-6_14"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Geldenhuys, J., van\u00a0der Merwe, B., van Zijl, L.: Reducing nondeterministic finite automata with SAT solvers. In: Yli-Jyr\u00e4, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) Finite-State Methods and Natural Language Processing. pp. 81\u201392. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14684-8_9"},{"key":"23_CR15","unstructured":"Goguen, J.A.: Discrete-time machines in closed monoidal categories. I. J. Comput. Syst. Sci. 10(1), 1\u201343 (1975)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Gramlich, G.: Probabilistic and nondeterministic unary automata. In: Proc. of Math. Foundations of Computer Science, Springer, LNCS 2747, 2003. pp.460\u2013469. Springer (2003)","DOI":"10.1007\/978-3-540-45138-9_40"},{"key":"23_CR17","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Birkh\u00e4user Verlag, 2. edn. (1998)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) Developments in Language Theory: 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006. Proceedings. pp. 363\u2013374. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11779148_33"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Horn, A., Kimura, N.: The category of semilattices. Algebra Univ. 1, 26\u201338 (1971)","DOI":"10.1007\/BF02944952"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Seibert, S., Karhum\u00e4ki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Information and Computation 172(2), 202\u2013217 (2002), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S089054010193069X","DOI":"10.1006\/inco.2001.3069"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Izhakian, Z., Rhodes, J., Steinberg, B.: Representation theory of finite semigroups over semirings. Journal of Algebra 336(1), 139\u2013157 (2011)","DOI":"10.1016\/j.jalgebra.2011.02.048"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal nfa\u2019s over a unary alphabet. International Journal of Foundations of Computer Science 02(02), 163\u2013182 (1991)","DOI":"10.1142\/S012905419100011X"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing 22(6), 1117\u20131141 (1993)","DOI":"10.1137\/0222067"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Jipsen, P.: Categories of algebraic contexts equivalent to idempotent semirings and domain semirings. In: Kahl, W., Griffin, T.G. (eds.) Relational and Algebraic Methods in Computer Science. pp. 195\u2013206. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)","DOI":"10.1007\/978-3-642-33314-9_13"},{"key":"23_CR25","unstructured":"Johnstone, P.T.: Stone spaces. Cambridge University Press (1982)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Kameda, T., Weiner, P.: On the state minimization of nondeterministic finite automata. IEEE Transactions on Computers C-19(7), 617\u2013627 (1970)","DOI":"10.1109\/T-C.1970.222994"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Kschischang, F.R.: The trellis structure of maximal fixed-cost codes. IEEE Transactions on Information Theory 42(6), 1828\u20131838 (1996)","DOI":"10.1109\/18.556678"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Latteux, M., Roos, Y., Terlutte, A.: Minimal NFA and biRFSA languages. RAIRO - Theoretical Informatics and Applications 43(2), 221\u2013237 (2009)","DOI":"10.1051\/ita:2008022"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Markowsky, G.: Primes, irreducibles and extremal lattices. Order 9, 265\u2013290 (09 1992)","DOI":"10.1007\/BF00383950"},{"key":"23_CR30","unstructured":"Myers, R.S.R.: Nondeterministic automata and JSL-dfas. CoRR abs\/2007.06031 (2020), https:\/\/arxiv.org\/abs\/2007.06031"},{"key":"23_CR31","unstructured":"Myers, R.S.R.: Representing semilattices as relations. CoRR abs\/2007.10277 (2020), https:\/\/arxiv.org\/abs\/2007.10277"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Myers, R.S.R., Ad\u00e1mek, J., Milius, S., Urbat, H.: Coalgebraic constructions of canonical nondeterministic automata. Theoretical Computer Science 604, 81\u2013101 (2015)","DOI":"10.1016\/j.tcs.2015.03.035"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Pin, J.\u00c9.: Mathematical foundations of automata theory (September 2020), available at http:\/\/www.liafa.jussieu.fr\/~jep\/PDF\/MPRI\/MPRI.pdf","DOI":"10.4171\/automata-1"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN \u201992. pp. 401\u2013416. Springer Berlin Heidelberg, Berlin, Heidelberg (1992)","DOI":"10.1007\/BFb0023844"},{"key":"23_CR35","unstructured":"Pol\u00e1k, L.: Syntactic semiring of a language. In: Sgall, J., Pultr, A., Kolman, P. (eds.) Mathematical Foundations of Computer Science 2001: 26thInternational Symposium, MFCS 2001 Mari\u00e1nsk\u00e9 L\u00e1zne, Czech Republic, August 27\u201331, 2001 Proceedings. pp. 611\u2013620. Springer Berlin Heidelberg, Berlin, Heidelberg (2001)"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Shankar, P., Dasgupta, A., Deshmukh, K., Rajan, B.: On viewing block codes as finite automata. Theoretical Computer Science 290(3), 1775\u20131797 (2003)","DOI":"10.1016\/S0304-3975(02)00083-X"},{"key":"23_CR37","unstructured":"Tamm, H.: New interpretation and generalization of the Kameda-Weiner method. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016, Rome, Italy. LIPIcs, vol.\u00a055, pp. 116:1\u2013116:12. SchlossDagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science 328(1), 135\u2013149 (2004)","DOI":"10.1016\/j.tcs.2004.07.010"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"van Heerdt, G., Moerman, J., Sammartino, M., Silva, A.: A (co)algebraic theory of succinct automata. Journal of Logical and Algebraic Methods in Programming 105, 112\u2013125 (2019)","DOI":"10.1016\/j.jlamp.2019.02.008"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71995-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:04:26Z","timestamp":1698084266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71995-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030719944","9783030719951"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71995-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FOSSACS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"88","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference changed to an online format due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}