{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:59:11Z","timestamp":1742950751062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81508-0_21","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"255-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reversible Top-Down Syntax Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0216-8803","authenticated-orcid":false,"given":"Uwe","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29, 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"21_CR3","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054118400063","volume":"29","author":"M Holzer","year":"2018","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. Int. J. Found. Comput. Sci. 29, 251\u2013270 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11505877_5","volume-title":"Developments in Language Theory","author":"J Kari","year":"2005","unstructured":"Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57\u201368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11505877_5"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Top-down syntax analysis. Acta Inform. 1, 79\u2013110 (1971)","journal-title":"Acta Inform."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Kutrib, M.: Aspects of reversibility for classical automata. In: Calude, C.S., Freivalds, G.R., Iwama, K. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 83\u201398. Springer (2014)","DOI":"10.1007\/978-3-319-13350-8_7"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-662-48057-1_3","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M.: Reversible and irreversible computations of deterministic finite-state devices. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 38\u201352. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_3"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.ic.2008.03.015","volume":"206","author":"M Kutrib","year":"2008","unstructured":"Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inform. Comput. 206, 1142\u20131151 (2008)","journal-title":"Inform. Comput."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.tcs.2009.10.017","volume":"411","author":"M Kutrib","year":"2010","unstructured":"Kutrib, M., Malcher, A.: Real-time reversible iterative arrays. Theor. Comput. Sci. 411, 812\u2013822 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814\u20131827 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-18812-6_5","volume-title":"Cellular Automata and Discrete Complex Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Real-time reversible one-way cellular automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 56\u201369. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18812-6_5"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-08494-7_4","volume-title":"Reversible Computation","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Worsch, T.: Degrees of reversibility for DFA and DPDA. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 40\u201353. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_4"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/321466.321477","volume":"15","author":"PM Lewis II","year":"1968","unstructured":"Lewis II, P.M., Stearns, R.E.: Syntax-directed transduction. J. ACM 15, 465\u2013488 (1968)","journal-title":"J. ACM"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(95)00038-X","volume":"148","author":"K Morita","year":"1995","unstructured":"Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theor. Comput. Sci. 148, 157\u2013163 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.01.041","volume":"395","author":"K Morita","year":"2008","unstructured":"Morita, K.: Reversible computing and cellular automata - a survey. Theor. Comput. Sci. 395, 101\u2013131 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"DJ Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Inform. Control 17, 226\u2013256 (1970)","journal-title":"Inform. Control"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0019-9958(82)91016-6","volume":"53","author":"S Sippu","year":"1982","unstructured":"Sippu, S., Soisalon-Soininen, E.: On $$\\rm LL(k)$$ parsing. Inform. Control 53, 141\u2013164 (1982)","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81508-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:34:41Z","timestamp":1628206481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"56% - 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","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":"6","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)"}}]}}