{"id":"https://openalex.org/W7104544764","doi":"https://doi.org/10.25596/jalc-2025-049","title":"Homomorphic Definitions of Tree Languages via Comma-Free Tree Codes","display_name":"Homomorphic Definitions of Tree Languages via Comma-Free Tree Codes","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7104544764","doi":"https://doi.org/10.25596/jalc-2025-049"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2025-049","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2025-049","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2025-049","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Crespi\u00a0Reghizzi, Stefano","orcid":"https://orcid.org/0000-0001-5061-7402"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Crespi\u00a0Reghizzi, Stefano","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"San\u00a0Pietro, Pierluigi","orcid":"https://orcid.org/0000-0002-2437-8716"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"San\u00a0Pietro, Pierluigi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60373682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.6761999726295471,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.6761999726295471,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.08110000193119049,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.05979999899864197,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6367999911308289},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5949000120162964},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5354999899864197},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5303999781608582},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.48080000281333923},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4440000057220459},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.44279998540878296},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4415000081062317},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4187999963760376},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.38760000467300415}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6367999911308289},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5949000120162964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5516999959945679},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5354999899864197},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5303999781608582},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.48080000281333923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47679999470710754},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.44279998540878296},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4415000081062317},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4187999963760376},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.38760000467300415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3707999885082245},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.36480000615119934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3594000041484833},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.34529998898506165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3346000015735626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33059999346733093},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.32120001316070557},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.29170000553131104},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.27959999442100525},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.2741999924182892},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.26159998774528503},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.2554999887943268},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2025-049","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2025-049","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2025-049","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2025-049","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Medvedev's":[0,269],"Theorem":[1,270],"(MT)":[2],"for":[3,66,110,255,271,282],"trees":[4],"says":[5],"that":[6,95],"a":[7,13,22,38,48,73,114,136,160,163,173,193,196,215,224,278],"regular":[8,272],"tree":[9,24,49,70,137,165,216,229,247],"language":[10,25,71,85,230,248,299],"$L$":[11],"over":[12,26],"ranked":[14],"alphabet":[15,28,32,127],"$\\Delta$":[16,36],"is":[17,33,57,146,198,211,231,252],"the":[18,42,45,54,62,68,83,97,100,105,111,124,133,142,156,168,185,191,206,219,245,259,266,290],"alphabetic":[19,143,291],"projection":[20,242],"of":[21,44,47,82,88,126,135,155,162,172,178,184,221,238,289,297],"local":[23,69,84],"an":[27],"$\\Lambda$.":[29],"The":[30,227,250,262],"latter":[31],"larger":[34],"than":[35],"by":[37,108,170,214],"factor":[39],"equal":[40],"to":[41,61,104,234],"size":[43,125,134],"state-set":[46],"automaton":[50,138,166],"recognizing":[51,139,167],"$L$,":[52],"i.e.,":[53,78],"\\emph{alphabetic":[55],"ratio}":[56],"$\\frac{|\\Lambda|}{|\\Delta|}=|Q|$.":[58],"Moving":[59],"from~MT":[60],"Extended":[63,268],"MT":[64],"(EMT)":[65],"trees,":[67,257],"becomes":[72],"strictly":[74],"locally":[75],"testable":[76,237],"one,":[77],"we":[79],"replace":[80],"2-grams":[81],"with":[86,277],"$h$-grams":[87],"testability":[89],"order":[90,113],"$h\\geq":[91],"2$.":[92],"We":[93],"prove":[94],"in":[96,116,119,159,218,294],"EMT":[98,251],"case":[99],"ratio":[101,144,292],"$\\frac{|\\Lambda|}{|\\Delta|}$":[102],"reduces":[103],"value":[106,115],"$2$,":[107],"choosing":[109],"testing":[112,239],"$\\mathcal{O}(\\lg(|Q|))$.":[117],"Therefore,":[118],"our":[120,287],"new":[121],"homomorphic":[122,295],"characterization":[123],"$\\Lambda$":[128],"does":[129],"not":[130],"depend":[131],"on":[132,152,205],"$L$.":[140,249],"Moreover,":[141],"two":[145],"proved":[147,254],"minimal.":[148],"The~EMT":[149],"proof":[150],"relies":[151],"encoding":[153,195],"some":[154],"states":[157],"traversed":[158],"run":[161,186],"top-down":[164],"language,":[169],"means":[171],"binary":[174],"uniform":[175],"comma-free":[176,225],"code":[177,217],"length~$k\\in":[179],"\\mathcal{O}(\\lg(|Q|))$.":[180],"For":[181],"every":[182],"node":[183,204],"at":[187],"distances":[188],"$k$":[189],"from":[190],"root,":[192],"codeword":[194],"state":[197,210],"orderly":[199],"laid":[200],"one":[201],"bit":[202],"per":[203],"paths.":[207],"Each":[208],"such":[209],"thus":[212],"encoded":[213],"sense":[220],"Nivat,":[222],"enjoying":[223],"property.":[226],"resulting":[228],"then":[232,243,253],"showed":[233],"be":[235],"strictly-locally":[236],"order~$2k$.":[240],"A":[241],"recovers":[244],"original":[246],"unranked":[256],"using":[258],"first-child-next-sibling":[260],"representation.":[261],"present":[263],"results":[264],"generalize":[265],"known":[267],"word":[273],"languages":[274],"and,":[275],"together":[276],"similar":[279],"recent":[280],"result":[281],"two-dimensional":[283],"picture":[284],"languages,":[285],"improve":[286],"knowledge":[288],"needed":[293],"definitions":[296],"different":[298],"families.":[300]},"counts_by_year":[],"updated_date":"2025-11-10T23:18:03.357015","created_date":"2025-11-10T00:00:00"}