{"id":"https://openalex.org/W2895057452","doi":"https://doi.org/10.1142/s012905411850020x","title":"From Tree Automata to Rational Tree Expressions","display_name":"From Tree Automata to Rational Tree Expressions","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2895057452","doi":"https://doi.org/10.1142/s012905411850020x","mag":"2895057452"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411850020x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411850020x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025001212","display_name":"Younes Guellouma","orcid":"https://orcid.org/0000-0002-1232-274X"},"institutions":[{"id":"https://openalex.org/I50219554","display_name":"University of Laghouat","ror":"https://ror.org/018bbh535","country_code":"DZ","type":"education","lineage":["https://openalex.org/I50219554"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Younes Guellouma","raw_affiliation_strings":["Laboratoire LIM, Universit\u00e9 Amar Telidji, Laghouat, Laghouat 03000, Alg\u00e9rie"],"affiliations":[{"raw_affiliation_string":"Laboratoire LIM, Universit\u00e9 Amar Telidji, Laghouat, Laghouat 03000, Alg\u00e9rie","institution_ids":["https://openalex.org/I50219554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046969653","display_name":"Hadda Cherroun","orcid":"https://orcid.org/0000-0002-5117-0320"},"institutions":[{"id":"https://openalex.org/I50219554","display_name":"University of Laghouat","ror":"https://ror.org/018bbh535","country_code":"DZ","type":"education","lineage":["https://openalex.org/I50219554"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hadda Cherroun","raw_affiliation_strings":["Laboratoire LIM, Universit\u00e9 Amar Telidji, Laghouat, Laghouat 03000, Alg\u00e9rie"],"affiliations":[{"raw_affiliation_string":"Laboratoire LIM, Universit\u00e9 Amar Telidji, Laghouat, Laghouat 03000, Alg\u00e9rie","institution_ids":["https://openalex.org/I50219554"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025001212"],"corresponding_institution_ids":["https://openalex.org/I50219554"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.15675977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"29","issue":"06","first_page":"1045","last_page":"1062"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/recursion","display_name":"Recursion (computer science)","score":0.7845456004142761},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7556225657463074},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6352460980415344},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6275961995124817},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5689674019813538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5151699781417847},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.4359278082847595},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.4189123511314392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3902536630630493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.388255774974823},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3029758334159851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27306222915649414},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1747729778289795}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7845456004142761},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7556225657463074},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6352460980415344},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6275961995124817},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5689674019813538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5151699781417847},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.4359278082847595},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.4189123511314392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3902536630630493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.388255774974823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3029758334159851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27306222915649414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1747729778289795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411850020x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411850020x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1512419429","https://openalex.org/W1559990457","https://openalex.org/W1996651813","https://openalex.org/W2002309677","https://openalex.org/W2016461613","https://openalex.org/W2035020702","https://openalex.org/W2050307662","https://openalex.org/W2094985106","https://openalex.org/W2129828874","https://openalex.org/W4212777788","https://openalex.org/W4230919050"],"related_works":["https://openalex.org/W2164619678","https://openalex.org/W1669105318","https://openalex.org/W2113544496","https://openalex.org/W1582302366","https://openalex.org/W2610542549","https://openalex.org/W1548463674","https://openalex.org/W3174875281","https://openalex.org/W2953470554","https://openalex.org/W2096488839","https://openalex.org/W1577306287"],"abstract_inverted_index":{"We":[0],"propose":[1,21],"a":[2,22,68,87],"construction":[3],"of":[4,36],"rational":[5,15,69,88],"tree":[6,10,62,70,89],"expression":[7,16,90],"from":[8],"finite":[9,61],"automata.":[11],"First,":[12],"we":[13,20,32,57],"define":[14],"equation":[17,42,71],"systems":[18,51],"and":[19,44,73],"substitution":[23],"based":[24],"method":[25],"to":[26,67,92],"find":[27],"the":[28,34,75,84,93],"unique":[29],"solution.":[30],"Furthermore,":[31],"discuss":[33],"case":[35],"recursion":[37],"being":[38],"present":[39],"in":[40,78],"an":[41],"system,":[43,72],"then":[45],"show":[46,58],"under":[47],"which":[48],"restrictions":[49],"such":[50],"can":[52,64,77],"effectively":[53],"be":[54,65,80],"solved.":[55],"Secondly,":[56],"that":[59,74],"any":[60],"automaton":[63,95],"associated":[66],"latter":[76],"turn":[79],"resolved.":[81],"Finally,":[82],"using":[83],"previous":[85],"steps,":[86],"equivalent":[91],"underlying":[94],"is":[96],"extracted.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}