{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:14:52Z","timestamp":1743066892527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549961"},{"type":"electronic","value":"9783030549978"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54997-8_28","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"443-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quotients and Atoms of Reversible Languages"],"prefix":"10.1007","author":[{"given":"Hellis","family":"Tamm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"issue":"3","key":"28_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(3), 741\u2013765 (1982)","journal-title":"J. ACM"},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1142\/S0129054117400044","volume":"28","author":"HB Axelsen","year":"2017","unstructured":"Axelsen, H.B., Holzer, M., Kutrib, M.: The degree of irreversibility in deterministic finite automata. Int. J. Found. Comput. Sci. 28(5), 503\u2013522 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00e1tomata. Theor. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","unstructured":"Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y. (1963)"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2007.12.004","volume":"107","author":"P Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, P., de Parga, M.V., L\u00f3pez, D.: On the efficient construction of quasi-reversible automata for reversible languages. Inf. Process. Lett. 107(1), 13\u201317 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"28_CR6","first-page":"331","volume":"34","author":"P H\u00e9am","year":"2000","unstructured":"H\u00e9am, P.: A lower bound for reversible automata. ITA 34(5), 331\u2013341 (2000)","journal-title":"ITA"},{"issue":"2","key":"28_CR7","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(2), 251\u2013270 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-59936-6_3","volume-title":"Reversible Computation","author":"M Holzer","year":"2017","unstructured":"Holzer, M., Kutrib, M.: Reversible nondeterministic finite automata. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 35\u201351. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59936-6_3"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ipl.2016.01.003","volume":"116","author":"S Iv\u00e1n","year":"2016","unstructured":"Iv\u00e1n, S.: Complexity of atoms, combinatorially. Inform. Process. Lett. 116, 356\u2013360 (2016)","journal-title":"Inform. Process. Lett."},{"issue":"1\u20133","key":"28_CR10","first-page":"145","volume":"22","author":"GJ Lavado","year":"2017","unstructured":"Lavado, G.J., Pighizzini, G., Prigioniero, L.: Minimal and reduced reversible automata. J. Autom. Lang. Combin. 22(1\u20133), 145\u2013168 (2017)","journal-title":"J. Autom. Lang. Combin."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Lavado, G.J., Pighizzini, G., Prigioniero, L.: Weakly and strongly irreversible regular languages. In: Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, 4\u20136 September 2017, pp. 143\u2013156 (2017)","DOI":"10.4204\/EPTCS.252.15"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45465-9_16","volume-title":"Automata, Languages and Programming","author":"S Lombardy","year":"2002","unstructured":"Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170\u2013182. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45465-9_16"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN 1992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/BFb0023844"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-73208-2_38","volume-title":"Developments in Language Theory","author":"H Tamm","year":"2007","unstructured":"Tamm, H.: On transition minimality of bideterministic automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 411\u2013421. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73208-2_38"},{"issue":"1\u20132","key":"28_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.010","volume":"328","author":"H Tamm","year":"2004","unstructured":"Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theor. Comput. Sci. 328(1\u20132), 135\u2013149 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:21:42Z","timestamp":1597090902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_28","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":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}