{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:48Z","timestamp":1764557508334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_17","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"223-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Descriptional Complexity of Iterated Uniform Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7778-7257","authenticated-orcid":false,"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-4658","authenticated-orcid":false,"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"17_CR1","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. Theor. Comput. Sci. 449, 23\u201336 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.009","journal-title":"Theor. Comput. Sci."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-13350-8_12","volume-title":"Computing with New Resources","author":"MP Bianchi","year":"2014","unstructured":"Bianchi, M.P., Mereghetti, C., Palano, B.: Complexity of Promise Problems on Classical and Quantum Automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 161\u2013175. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_12"},{"issue":"1\u20133","key":"17_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.059","volume":"369","author":"H Bordihn","year":"2006","unstructured":"Bordihn, H., Fernau, H., Holzer, M., Manca, V., Mart\u00edn-Vide, C.: Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1\u20133), 67\u201381 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.07.059","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/0215049","volume":"15","author":"C Citrini","year":"1986","unstructured":"Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: On deterministic multi-pass analysis. SIAM J. Comput. 15(3), 668\u2013693 (1986). https:\/\/doi.org\/10.1137\/0215049","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2003.10.007","volume":"313","author":"N Friburger","year":"2004","unstructured":"Friburger, N., Maurel, D.: Finite-state transducer cascades to extract named entities in texts. Theor. Comput. Sci. 313(1), 93\u2013104 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.10.007","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR6","first-page":"251","volume":"21","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21(4), 251\u2013310 (2017)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ginzburg, A.: Algebraic Theory of Automata. Academic Press (1968)","DOI":"10.1016\/B978-1-4832-0013-2.50009-6"},{"key":"17_CR8","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice-Hall (1966)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/321450.321464","volume":"15","author":"J Hartmanis","year":"1968","unstructured":"Hartmanis, J.: Computational complexity of one-tape turing machine computations. J. ACM 15(2), 325\u2013339 (1968). https:\/\/doi.org\/10.1145\/321450.321464","journal-title":"J. ACM"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Descriptional complexity - 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"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. System Sci. 11(1), 68\u201385 (1975)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"ND Jones","year":"1976","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor. Comput. Sci. 3(1), 105\u2013117 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2012.04.007","volume":"449","author":"A Malcher","year":"2012","unstructured":"Malcher, A., Mereghetti, C., Palano, B.: Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449, 119\u2013133 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.007","journal-title":"Theor. Comput. Sci."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Manca, V.: On the generative power of iterated transductions. In: Ito, M., Paun, G., Yu, S. (eds.) Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin, pp. 315\u2013327. World Scientific (2001)","DOI":"10.1142\/9789812810908_0024"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34, 1045\u20131079 (1955). https:\/\/doi.org\/10.1002\/j.1538-7305.1955.tb03788.x","journal-title":"Bell Syst. Tech. J."},{"key":"17_CR16","unstructured":"Pierce, A.: Decision problems on iterated length-preserving transducers. Bachelor\u2019s thesis, SCS Carnegie Mellon University, Pittsburgh (2011)"},{"issue":"2\u20133","key":"17_CR17","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. Theor. Comput. Sci. 320(2\u20133), 315\u2013329 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:45Z","timestamp":1739343045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}