{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:09:06Z","timestamp":1743008946147,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_28","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"342-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Linear-Time Simulation of Deterministic d-Limited Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8850-9749","authenticated-orcid":false,"given":"Alexander A.","family":"Rubtsov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is Valiant\u2019s parser. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 98\u2013117 (2015)","DOI":"10.1109\/FOCS.2015.16"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/S009753979528682X","volume":"29","author":"E Bertsch","year":"1999","unstructured":"Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29(1), 81\u2013102 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(89)90075-3","volume":"63","author":"JC Birget","year":"1989","unstructured":"Birget, J.C.: Concatenation of inputs in a two-way automaton. Theor. Comput. Sci. 63(2), 141\u2013156 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Birman, A., Ullman, J.D.: Parsing algorithms with backtrack. In: 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), pp. 153\u2013174 (1970)","DOI":"10.1109\/SWAT.1970.18"},{"key":"28_CR5","unstructured":"Cook, S.A.: Linear time simulation of deterministic two-way pushdown automata. University of Toronto, Department of Computer Science (1970)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: SIGPLAN Notics, vol. 39, no. 1, pp. 111\u2013122 (2004)","DOI":"10.1145\/982962.964011"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R.: Simulation of two-way pushdown automata revisited. In: Electronic Proceedings in Theoretical Computer Science, vol. 129, p. 250\u2013258. Open Publishing Association, September 2013","DOI":"10.4204\/EPTCS.129.15"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2019.03.037","volume":"798","author":"B Guillon","year":"2019","unstructured":"Guillon, B., Prigioniero, L.: Linear-time limited automata. Theor. Comput. Sci. 798, 95\u2013108 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F Hennie","year":"1965","unstructured":"Hennie, F.: One-tape, off-line turing machine computations. Inf. Control 8(6), 553\u2013578 (1965)","journal-title":"Inf. Control"},{"issue":"1\/2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0019-9958(67)90513-X","volume":"11","author":"TN Hibbard","year":"1967","unstructured":"Hibbard, T.N.: A generalization of context-free determinism. Inf. Control 11(1\/2), 196\u2013238 (1967)","journal-title":"Inf. Control"},{"key":"28_CR11","unstructured":"Jayaram, R., Saha, B.: Approximating language edit distance beyond fast matrix multiplication: ultralinear grammars are where parsing becomes hard! In: ICALP 2017, pp. 19:1\u201319:15 (2017)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D Knuth","year":"1965","unstructured":"Knuth, D.: On the translation of languages from left to right. Inf. Control 8, 607\u2013639 (1965)","journal-title":"Inf. Control"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505241.505242","volume":"49","author":"L Lee","year":"2002","unstructured":"Lee, L.: Fast context-free grammar parsing requires fast Boolean matrix multiplication. J. ACM 49(1), 1\u201315 (2002)","journal-title":"J. ACM"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-98654-8_40","volume-title":"Developments in Language Theory","author":"B Loff","year":"2018","unstructured":"Loff, B., Moreira, N., Reis, R.: The computational power of parsing expression grammars. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 491\u2013502. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_40"},{"issue":"1","key":"28_CR15","first-page":"107","volume":"14","author":"G Pighizzini","year":"2009","unstructured":"Pighizzini, G.: Nondeterministic one-tape off-line turing machines and their time complexity. J. Autom. Lang. Comb. 14(1), 107\u2013124 (2009)","journal-title":"J. Autom. Lang. Comb."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-23247-4_4","volume-title":"Descriptional Complexity of Formal Systems","author":"G Pighizzini","year":"2019","unstructured":"Pighizzini, G.: Limited automata: properties, complexity and variants. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 57\u201373. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_4"},{"issue":"1\u20132","key":"28_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3233\/FI-2015-1148","volume":"136","author":"G Pighizzini","year":"2015","unstructured":"Pighizzini, G., Pisoni, A.: Limited automata and context-free languages. Fundamenta Informaticae 136(1\u20132), 157\u2013176 (2015)","journal-title":"Fundamenta Informaticae"},{"key":"28_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"JO Shallit","year":"2008","unstructured":"Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"JC Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198\u2013200 (1959)","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2009.08.031","volume":"411","author":"K Tadaki","year":"2010","unstructured":"Tadaki, K., Yamakami, T., Lin, J.C.: Theory of one-tape linear-time turing machines. Theor. Comput. Sci. 411(1), 22\u201343 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10(2), 308\u2013315 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1800-9","volume-title":"Computational Complexity","author":"K Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Springer, Netherlands (1986). https:\/\/doi.org\/10.1007\/978-1-4614-1800-9"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:34:52Z","timestamp":1628206492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_28","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)"}}]}}