{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:47Z","timestamp":1725905447046},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_16","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"222-234","source":"Crossref","is-referenced-by-count":0,"title":["On the Descriptive Complexity of $$\\overline{\\varSigma ^*\\overline{L}}$$"],"prefix":"10.1007","author":[{"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J Birget","year":"1992","unstructured":"Birget, J.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43(4), 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"16_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(96)00044-0","volume":"58","author":"J Birget","year":"1996","unstructured":"Birget, J.: The state complexity of $$\\overline{{\\Sigma }^* \\overline{L}}$$ and its connection with temporal logic. Inform. Process. Lett. 58(4), 185\u2013188 (1996)","journal-title":"Inform. Process. Lett."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-41114-9_6","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szyku\u0142a, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73\u201386. Springer, Cham (2016). doi: 10.1007\/978-3-319-41114-9_6"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"JA Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci. 10, 19\u201335 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0022-0000(93)90005-H","volume":"46","author":"J Cohen","year":"1993","unstructured":"Cohen, J., Perrin, D., Pin, J.: On the expressive power of temporal logic. J. Comput. Syst. Sci. 46(3), 271\u2013294 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20134","key":"16_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/00207169008803893","volume":"35","author":"A Fellah","year":"1990","unstructured":"Fellah, A., J\u00fcrgensen, H., Yu, S.: Constructions for alternating finite automata. Int. J. Comput. Math. 35(1\u20134), 117\u2013132 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"16_CR7","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. CoRR abs\/1509.03254 (2015). http:\/\/arxiv.org\/abs\/1509.03254"},{"issue":"2","key":"16_CR8","doi-asserted-by":"crossref","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. 330(2), 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-30642-6_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G.: Descriptional complexity of operations on alternating and boolean automata. In: Hirsch, E.A., Karhum\u00e4ki, J., Lepist\u00f6, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol. 7353, pp. 196\u2013204. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30642-6_19"},{"issue":"3","key":"16_CR10","doi-asserted-by":"crossref","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. Inform. Comput. 209(3), 528\u2013535 (2011)","journal-title":"Inform. Comput."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.: Removing bidirectionality from nondeterministic finite automata. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). doi: 10.1007\/11549345_47"},{"key":"16_CR12","first-page":"373","volume":"213","author":"D Kleitman","year":"1975","unstructured":"Kleitman, D., Markowsky, G.: On Dedekind\u2019s problem: the number of isotone boolean functions. II. Trans. Amer. Math. Soc. 213, 373\u2013390 (1975)","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: Succint representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR14","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata. Problemy Kibernetiki 9, 321\u2013326 (1963). (in Russian) German translation: \u00dcber den Vergleich zweier Typen endlicher Quellen. Probleme der Kybernetik 6, 328\u2013335 (1966)"},{"key":"16_CR15","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady 11, 1373\u20131375 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of the $$12$$ th Annual Symposium on Switching and Automata Theory, pp. 188\u2013191. IEEE Computer Society Press (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. C-20, 1211\u20131219 (1971)","DOI":"10.1109\/T-C.1971.223108"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114\u2013125 (1959)","journal-title":"IBM J. Res. Develop."},{"key":"16_CR19","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning (2012)"},{"key":"16_CR20","unstructured":"Yershov, Yu.L.: On a conjecture of V. A. Uspenskii. Algebra i Logika (Seminar) 1, 45\u201348 (1962). (in Russian)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Yu, S.: Chapter 2: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41\u2013110. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"2","key":"16_CR22","doi-asserted-by":"crossref","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. 125(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T23:05:14Z","timestamp":1569884714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}