{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090376,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031132568"},{"type":"electronic","value":"9783031132575"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-13257-5_1","type":"book-chapter","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:02:52Z","timestamp":1661122972000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Alphabetic Complexity in\u00a0Homomorphic Definitions of\u00a0Word, Tree and\u00a0Picture Languages"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2016.09.025","volume":"657","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Non-expandable non-overlapping sets of pictures. Theor. Comput. Sci. 657, 127\u2013136 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Encyclopedia of Mathematics and its Applications, vol. 129. CUP (2009)","DOI":"10.1017\/CBO9781139195768"},{"key":"1_CR3","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-81508-0_9","volume-title":"Developments in Language Theory","author":"S Crespi Reghizzi","year":"2021","unstructured":"Crespi Reghizzi, S., Restivo, A., San Pietro, P.: Reducing local alphabet size in recognizable picture languages. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 103\u2013116. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_9"},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1142\/S0129054112400710","volume":"23","author":"S Crespi-Reghizzi","year":"2012","unstructured":"Crespi-Reghizzi, S., San Pietro, P.: From regular to strictly locally testable languages. Int. J. Found. Comput. Sci. 23(8), 1711\u20131728 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-21363-3_11","volume-title":"Algebraic Informatics","author":"S Crespi Reghizzi","year":"2019","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Regular languages as local functions with small alphabets. In: \u0106iri\u0107, M., Droste, M., Pin, J.\u00c9. (eds.) CAI 2019. LNCS, vol. 11545, pp. 124\u2013137. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21363-3_11"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-68195-1_19","volume-title":"Language and Automata Theory and Applications","author":"S Crespi Reghizzi","year":"2021","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Homomorphic characterization of tree languages based on comma-free encoding. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 241\u2013254. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_19"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/TIT.1965.1053766","volume":"11","author":"WL Eastman","year":"1965","unstructured":"Eastman, W.L.: On the construction of comma-free codes. IEEE Trans. Inf. Theory 11(2), 263\u2013267 (1965)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR9","unstructured":"Gecseg, F., Steinby, M.: Tree Automata. arXiv (2015)"},{"issue":"2\u20133","key":"1_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6(2\u20133), 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215\u2013267. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_4"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","volume":"10","author":"SW Golomb","year":"1958","unstructured":"Golomb, S.W., Gordon, B., Welch, L.: Comma-free codes. Can. J. Math. 10, 202\u2013209 (1958)","journal-title":"Can. J. Math."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/S0022-0000(76)80007-4","volume":"12","author":"K Hashiguchi","year":"1976","unstructured":"Hashiguchi, K., Honda, N.: Properties of code events and homomorphisms over regular events. J. Comput. Syst. Sci. 12(3), 352\u2013367 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR14","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"1_CR15","unstructured":"Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential Machines - Selected Papers, pp. 215\u2013227. Addison-Wesley (1964). Originally Published in Russian in Avtomaty, pp. 385\u2013401 (1956)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Place, T., Segoufin, L.: A decidable characterization of locally testable tree languages. Log. Methods Comput. Sci. 7(4) (2011)","DOI":"10.2168\/LMCS-7(4:3)2011"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0019-9958(74)90821-3","volume":"25","author":"A Restivo","year":"1974","unstructured":"Restivo, A.: On a question of McNaughton and Papert. Inf. Control 25(1), 93\u2013101 (1974)","journal-title":"Inf. Control"},{"key":"1_CR18","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press (1974)"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25(3), 360\u2013376 (1982)","journal-title":"J. Comput. Syst. 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-031-13257-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:03:06Z","timestamp":1661122986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13257-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031132568","9783031132575"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13257-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 August 2022","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":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/konferencia.unideb.hu\/en\/dcfs-2022","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":"17","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":"14","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":"82% - 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":"2.3","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)"}}]}}