{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:48Z","timestamp":1759637628478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_10","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"117-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9589-5833","authenticated-orcid":false,"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7778-7257","authenticated-orcid":false,"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-4658","authenticated-orcid":false,"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"10_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. Thoer. Comput. Sci. 449, 23\u201336 (2012)","journal-title":"Thoer. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.ic.2014.03.002","volume":"237","author":"Z Bedn\u00e1rov\u00e1","year":"2014","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237, 257\u2013267 (2014)","journal-title":"Inf. Comput."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s11047-009-9154-8","volume":"9","author":"A Bertoni","year":"2010","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Trace monoids with idempotent generators and measure only quantum automata. Natl. Comput. 9, 383\u2013395 (2010)","journal-title":"Natl. Comput."},{"key":"10_CR4","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"},{"key":"10_CR5","first-page":"1","volume":"104","author":"MP Bianchi","year":"2010","unstructured":"Bianchi, M.P., Palano, B.: Behaviours of unary quantum automata. Fund. Inf. 104, 1\u201315 (2010)","journal-title":"Fund. Inf."},{"key":"10_CR6","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, 67\u201381 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR7","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, 668\u2013693 (1986)","journal-title":"SIAM J. Comput."},{"key":"10_CR8","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, 93\u2013104 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","volume-title":"Algebraic Theory of Automata","author":"A Ginzburg","year":"1968","unstructured":"Ginzburg, A.: Algebraic Theory of Automata. Academic Press, New York (1968)"},{"key":"10_CR10","volume-title":"An Introduction to the Theory of Numbers","author":"G Hardy","year":"1979","unstructured":"Hardy, G., Wright, E.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)","edition":"5"},{"key":"10_CR11","volume-title":"Algebraic Structure Theory of Sequential Machines","author":"J Hartmanis","year":"1966","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-23247-4_17","volume-title":"Descriptional Complexity of Formal Systems","author":"M Kutrib","year":"2019","unstructured":"Kutrib, M., Malcher, A., Mereghetti, C., Palano, B.: Descriptional complexity of iterated uniform finite-state transducers. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 223\u2013234. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_17"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-51466-2_8","volume-title":"Beyond the Horizon of Computability","author":"M Kutrib","year":"2020","unstructured":"Kutrib, M., Malcher, A., Mereghetti, C., Palano, B.: Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 87\u201399. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_8"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2015.01.012","volume":"578","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Deterministic input-driven queue automata: finite turns, decidability, and closure properties. Theor. Comput. Sci. 578, 58\u201371 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR15","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)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Manca, V.: On the generative power of iterated transductions. In: Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin, pp. 315\u2013327. World Scientific (2001)","DOI":"10.1142\/9789812810908_0024"},{"key":"10_CR17","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)","journal-title":"Bell Syst. Tech. J."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1142\/S012905410800598X","volume":"19","author":"C Mereghetti","year":"2008","unstructured":"Mereghetti, C.: Testing the descriptional power of small Turing machines on nonregular language acceptance. Int. J. Found. Comput. Sci. 19, 827\u2013843 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1051\/ita:2001106","volume":"35","author":"C Mereghetti","year":"2001","unstructured":"Mereghetti, C., Palano, B., Pighizzini, G.: Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata. Theor. Inf. Appl. 35, 477\u2013490 (2001)","journal-title":"Theor. Inf. Appl."},{"key":"10_CR20","first-page":"287","volume":"5","author":"C Mereghetti","year":"2000","unstructured":"Mereghetti, C., Pighizzini, G.: Two-way automata simulations and unary languages. J. Autom. Lang. Comb. 5, 287\u2013300 (2000)","journal-title":"J. Autom. Lang. Comb."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6, 230\u2013245 (1963)","journal-title":"Inf. Control"}],"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-62536-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:51Z","timestamp":1741634571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}