{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:26Z","timestamp":1725731366554},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_11","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"102-111","source":"Crossref","is-referenced-by-count":1,"title":["Nondeterministic State Complexity of Proportional Removals"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Palioudakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","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. Theor. Comput. Sci.\u00a047(3), 149\u2013158 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR2","first-page":"455","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity of proportional removals. Journal of Automata, Languages and Combinatorics\u00a07(4), 455\u2013468 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"11_CR3","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A review of state complexity of individual operations. Technical report, Universidade do Porto, Technical Report Series DCC-2011-08, Version 1.1 (September 2012), \n                  \n                    http:\/\/www.dcc.fc.up.pt\/Pubs"},{"issue":"2","key":"11_CR4","first-page":"193","volume":"8","author":"J. Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS\u00a08(2), 193\u2013234 (2002)","journal-title":"J. UCS"},{"issue":"6","key":"11_CR5","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(6), 1087\u20131102 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0129054109006747","volume":"20","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci.\u00a020(4), 563\u2013580 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inf. Comput.\u00a0209(3), 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"11_CR8","first-page":"328","volume":"9","author":"O. Lupanov","year":"1963","unstructured":"Lupanov, O.: A comparison of two types of finite sources. Problemy Kibernetiki\u00a09, 328\u2013335 (1963)","journal-title":"Problemy Kibernetiki"},{"key":"11_CR9","first-page":"1266","volume":"194","author":"A. Maslov","year":"1970","unstructured":"Maslov, A.: Estimates of the number of states of finite automata. Doklady Akademii Nauk SSSR\u00a0194, 1266\u20131268 (1970)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS), pp. 188\u2013191. IEEE Computer Society (1971)","DOI":"10.1109\/SWAT.1971.11"},{"issue":"10","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"C-20","author":"F. Moore","year":"1971","unstructured":"Moore, F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transactions on Computers\u00a0C-20(10), 1211\u20131214 (1971)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0304-3975(76)90030-X","volume":"2","author":"J.I. Seiferas","year":"1976","unstructured":"Seiferas, J.I., McNaughton, R.: Regularity-preserving relations. Theor. Comput. Sci.\u00a02(2), 147\u2013154 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511808876"},{"issue":"2","key":"11_CR14","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(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular Languages. In: Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer (1998)","DOI":"10.1007\/978-3-642-59136-5_2"}],"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-642-39310-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:04:11Z","timestamp":1557806651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}