{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:30:40Z","timestamp":1751293840414},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_9","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"100-111","source":"Crossref","is-referenced-by-count":4,"title":["Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[]},{"given":"Zuzana","family":"Bedn\u00e1rov\u00e1","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[]},{"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-31623-4_6","volume-title":"Descriptional Complexity of Formal Systems","author":"Z. Bedn\u00e1rov\u00e1","year":"2012","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 76\u201388. Springer, Heidelberg (2012)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2012.05.009","volume":"449","author":"Z. Bedn\u00e1rov\u00e1","year":"2012","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: The size-cost of Boolean operations on constant height deterministic pushdown automata. Theoret. Comput. Sci.\u00a0449, 23\u201336 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., Zieger, P.: Complexity measures for regular expressions. J.\u00a0Comput. System Sci.\u00a012, 134\u2013146 (1976)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ic.2010.01.002","volume":"208","author":"V. Geffert","year":"2010","unstructured":"Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. & Comp.\u00a0208, 385\u2013394 (2010)","journal-title":"Inf. & Comp."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.tcs.2009.04.009","volume":"410","author":"H. Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theoret. Comput. Sci.\u00a0410, 3281\u20133289 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Descriptional complexity \u2014 an introductory survey. In: Mart\u00edn-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1\u201358. Imperial College Press (2010)","DOI":"10.1142\/9781848165458_0001"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (2001)","DOI":"10.1145\/568438.568455"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00236-007-0068-6","volume":"45","author":"M. Kutrib","year":"2008","unstructured":"Kutrib, M., Malcher, A., Wotschke, D.: The Boolean closure of linear context-free languages. Acta Inform.\u00a045, 177\u2013191 (2008)","journal-title":"Acta Inform."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Meyer, A., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: Proc. IEEE Symp. Switching & Automata Th., pp. 188\u2013191 (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G. Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. Internat. J. Found. Comput. Sci.\u00a013, 145\u2013159 (2002)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"9_CR11","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. Develop.\u00a03, 114\u2013125 (1959)","journal-title":"IBM J. Res. Develop."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"9_CR13","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."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:58:46Z","timestamp":1557766726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}