{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:18:20Z","timestamp":1742966300185,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_2","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"5-24","source":"Crossref","is-referenced-by-count":4,"title":["In Search of Most Complex Regular Languages"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\/2","key":"2_CR1","first-page":"71","volume":"15","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb.\u00a015(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"key":"2_CR2","series-title":"LNCS","volume-title":"Proceedings of the 14th International Workshop on Descriptional Complexity of Formal Systems (DCFS)","author":"J. Brzozowski","year":"2012","unstructured":"Brzozowski, J., Li, B.: Syntactic complexities of some classes of star-free languages. In: Proceedings of the 14th International Workshop on Descriptional Complexity of Formal Systems (DCFS). LNCS. Springer, Heidelberg (to appear, 2012)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Li, B., Ye, Y.: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theoret. Comput. Sci. (in press, 2012)","DOI":"10.1016\/j.tcs.2012.04.011"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-22321-1_10","volume-title":"Developments in Language Theory","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00c1tomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 105\u2013116. Springer, Heidelberg (2011)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 16th International Conference on Developments in Language Theory (DLT)","author":"J. Brzozowski","year":"2012","unstructured":"Brzozowski, J., Tamm, H.: Quotient complexity of atoms of regular languages. In: Proceedings of the 16th International Conference on Developments in Language Theory (DLT). LNCS. Springer, Heidelberg (to appear, 2012)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22321-1_11","volume-title":"Developments in Language Theory","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Ye, Y.: Syntactic Complexity of Ideal and Closed Languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 117\u2013128. Springer, Heidelberg (2011)"},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1142\/S0129054111009045","volume":"22","author":"B. Cui","year":"2011","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of two combined operations: catenation-union and catenation-intersection. Int. J. Found. Comput. Sc.\u00a022(8), 1797\u20131812 (2011)","journal-title":"Int. J. Found. Comput. Sc."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2012.02.030","volume":"437","author":"B. Cui","year":"2012","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theoret. Comput. Sci.\u00a0437, 82\u2013102 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S0129054112400047","volume":"23","author":"B. Cui","year":"2012","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of two combined operations: catenation-star and catenation-reversal. Int. J. Found. Comput. Sc.\u00a023(1), 51\u201366 (2012)","journal-title":"Int. J. Found. Comput. Sc."},{"key":"2_CR10","unstructured":"D\u00e9nes, J.: On transformations, transformation semigroups and graphs. In: Erd\u00f6s, P., Katona, G. (eds.) Theory of Graphs. Proceedings of the Colloquium on Graph Theory held at Tihany 1966, pp. 65\u201375. Akad\u00e9miai Kiado (1968)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ganyushkin, O., Mazorchuk, V.: Classical Finite Transformation Semigroups: An Introduction. Springer (2009)","DOI":"10.1007\/978-1-84800-281-4"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Gao, Y., Kari, L., Yu, S.: State complexity of union and intersection of square and reversal on k regular languages. Theoret. Comput. Sci. (in press, 2012)","DOI":"10.1016\/j.tcs.2011.12.028"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2011.12.028","volume":"429","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Kari, L., Yu, S.: State complexity of union and intersection of star on k regular languages. Theoret. Comput. Sci.\u00a0429, 98\u2013107 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR14","first-page":"75","volume":"83","author":"Y. Gao","year":"2008","unstructured":"Gao, Y., Salomaa, K., Yu, S.: The state complexity of two combined operations: star of catenation and star of reversal. Fund. Inform.\u00a083(1-2), 75\u201389 (2008)","journal-title":"Fund. Inform."},{"key":"2_CR15","first-page":"1","volume":"116","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Yu, S.: State complexity of combined operations with union, intersection, star, and reversal. Fund. Inform.\u00a0116, 1\u201312 (2012)","journal-title":"Fund. Inform."},{"key":"2_CR16","first-page":"1","volume":"109","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Fund. Inform.\u00a0109, 1\u201318 (2011)","journal-title":"Fund. Inform."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-642-22600-7_17","volume-title":"DCFS 2011","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Note on Reversal of Binary Regular Languages. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol.\u00a06808, pp. 212\u2013221. Springer, Heidelberg (2011)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by boolean automata. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR19","first-page":"1266","volume":"194","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR\u00a0194, 1266\u20131268 (1970) (Russian); English translation: Soviet Math. Dokl.\u00a011, 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2_CR20","unstructured":"McNaughton, R., Papert, S.A.: Counter-Free Automata. M.I.T. Research Monographs, vol.\u00a065. The MIT Press (1971)"},{"key":"2_CR21","first-page":"7","volume":"2","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: On dual automata. Kibernetika (Kiev)\u00a02, 7\u201310 (1966) (Russian); English translation: Cybernetics\u00a02, 6\u20139 (1966)","journal-title":"Kibernetika (Kiev)"},{"key":"2_CR22","unstructured":"Myhill, J.: Finite automata and representation of events. Wright Air Development Center Technical Report 57\u2013624 (1957)"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"298","DOI":"10.4064\/fm-24-1-298-301","volume":"24","author":"S. Piccard","year":"1935","unstructured":"Piccard, S.: Sur les fonctions d\u00e9finies dans les ensembles finis quelconques. Fund. Math.\u00a024, 298\u2013301 (1935)","journal-title":"Fund. Math."},{"key":"2_CR24","series-title":"Word, Language, Grammar","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J.E. Pin","year":"1997","unstructured":"Pin, J.E.: Syntactic semigroups. In: Handbook of Formal Languages. Word, Language, Grammar, vol.\u00a01, pp. 679\u2013746. Springer, New York (1997)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. and Dev.\u00a03, 114\u2013129 (1959)","journal-title":"IBM J. Res. and Dev."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A. Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoret. Comput. Sci.\u00a0383, 140\u2013152 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"A. Salomaa","year":"2004","unstructured":"Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci.\u00a0320, 315\u2013329 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR28","doi-asserted-by":"crossref","first-page":"209","DOI":"10.4064\/fm-24-1-209-212","volume":"24","author":"W. Sierpi\u0144ski","year":"1935","unstructured":"Sierpi\u0144ski, W.: Sur les suites infinies de fonctions d\u00e9finies dans les ensembles quelconques. Fund. Math.\u00a024, 209\u2013212 (1935)","journal-title":"Fund. Math."},{"key":"2_CR29","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 complexities of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR30","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb.\u00a06, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:35:24Z","timestamp":1676784924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}