{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:30Z","timestamp":1759638930533},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_20","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T09:43:21Z","timestamp":1405071801000},"page":"222-233","source":"Crossref","is-referenced-by-count":5,"title":["Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of information transfer in VLSI circuits. In: Johnson, D.S., et al. (eds.) STOC 1983, pp. 133\u2013139. ACM (1983)","DOI":"10.1145\/800061.808742"},{"key":"20_CR2","series-title":"Efficient Algorithms","volume-title":"2.7 in Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: 2.7 in Algorithmic Number Theory. Efficient Algorithms, vol.\u00a01. MIT Press, Cambridge (1996)"},{"key":"20_CR3","unstructured":"Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267\u2013291 (1993), ERRATUM: Partial orders on words, minimal elements of regular languages, and state complexity (2002), http:\/\/clam.rutgers.edu\/~birget\/papers.html"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-39310-5_7","volume-title":"Descriptional Complexity of Formal Systems","author":"H.-S. Eom","year":"2013","unstructured":"Eom, H.-S., Han, Y.-S., Jir\u00e1skov\u00e1, G.: State complexity of basic operations on non-returning regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol.\u00a08031, pp. 54\u201365. Springer, Heidelberg (2013)"},{"key":"20_CR7","unstructured":"Ellul, K.: Descriptional complexity measures of regular languages. Master\u2019s thesis. University of Waterloo (2002)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoret. Comput. Sci.\u00a0410, 2537\u20132548 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR9","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99\u2013115. Institute of Informatics, University of Szeged (2009)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform.\u00a090, 93\u2013106 (2009)","journal-title":"Fundam. Inform."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Han, Y.-S., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) DCFS 2010. EPTCS, vol.\u00a031, pp. 189\u2013196 (2010)","DOI":"10.4204\/EPTCS.31.21"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci.\u00a014, 1087\u20131102 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J.: Communication complexity and parallel computing. Springer (1997)","DOI":"10.1007\/978-3-662-03442-2"},{"key":"20_CR14","series-title":"MTA SZTAKI","first-page":"114","volume-title":"DCFS 2003","author":"G. Jir\u00e1skov\u00e1","year":"2003","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on regular languages. In: Csuhaj-Varj\u00fa, E., et al. (eds.) DCFS 2003. MTA SZTAKI, pp. 114\u2013125. Hungarian Academy of Sciences, Budapest (2003)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G. Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci.\u00a0330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR16","first-page":"1373","volume":"11","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proc. 10th Annual ACM Symposium on Theory of Computing, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"20_CR18","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.ipl.2009.06.005","volume":"109","author":"A.W. To","year":"2009","unstructured":"To, A.W.: Unary finite automata vs. arithmetic progressions. Inform. Process. Lett.\u00a0109, 1010\u20131014 (2009)","journal-title":"Inform. Process. Lett."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, ch. 2, pp. 41\u2013110. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"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-09704-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T06:00:03Z","timestamp":1598076003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}