{"id":"https://openalex.org/W1969183341","doi":"https://doi.org/10.1007/s00453-008-9172-4","title":"Incremental Construction of Minimal Tree Automata","display_name":"Incremental Construction of Minimal Tree Automata","publication_year":2008,"publication_date":"2008-02-05","ids":{"openalex":"https://openalex.org/W1969183341","doi":"https://doi.org/10.1007/s00453-008-9172-4","mag":"1969183341"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9172-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9172-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5040165184","display_name":"Rafael C. Carrasco","orcid":"https://orcid.org/0000-0002-4726-9694"},"institutions":[{"id":"https://openalex.org/I130194489","display_name":"University of Alicante","ror":"https://ror.org/05t8bcz72","country_code":"ES","type":"education","lineage":["https://openalex.org/I130194489"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Rafael C. Carrasco","raw_affiliation_strings":["Dep. de Lenguajes y Sistemas Inform\u00e1ticos, Universidad de Alicante, Carretera de San Vicente s/n, 03071, Alicante, Spain","Universidad de Alicante, Dep. de Lenguajes y Sistemas Inform\u00e1ticos, Carretera de San Vicente s/n, 03071, Alicante, Spain#TAB#"],"affiliations":[{"raw_affiliation_string":"Dep. de Lenguajes y Sistemas Inform\u00e1ticos, Universidad de Alicante, Carretera de San Vicente s/n, 03071, Alicante, Spain","institution_ids":["https://openalex.org/I130194489"]},{"raw_affiliation_string":"Universidad de Alicante, Dep. de Lenguajes y Sistemas Inform\u00e1ticos, Carretera de San Vicente s/n, 03071, Alicante, Spain#TAB#","institution_ids":["https://openalex.org/I130194489"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004158565","display_name":"Jan Daciuk","orcid":null},"institutions":[{"id":"https://openalex.org/I169333911","display_name":"Gda\u0144sk University of Technology","ror":"https://ror.org/006x4sc24","country_code":"PL","type":"education","lineage":["https://openalex.org/I169333911"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jan Daciuk","raw_affiliation_strings":["Knowledge Engineering Department, Gda\u0144sk University of Technology, Ul. G. Narutowicza 11/12, 80-952, Gda\u0144sk, Poland","Gda\u0144sk University of Technology, Knowledge Engineering Department, Ul. G. Narutowicza 11/12, 80-952, Gda\u0144sk, Poland#TAB#"],"affiliations":[{"raw_affiliation_string":"Knowledge Engineering Department, Gda\u0144sk University of Technology, Ul. G. Narutowicza 11/12, 80-952, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I169333911"]},{"raw_affiliation_string":"Gda\u0144sk University of Technology, Knowledge Engineering Department, Ul. G. Narutowicza 11/12, 80-952, Gda\u0144sk, Poland#TAB#","institution_ids":["https://openalex.org/I169333911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001715786","display_name":"Mikel L. Forcada","orcid":"https://orcid.org/0000-0003-0843-6442"},"institutions":[{"id":"https://openalex.org/I4210091477","display_name":"Hospital Universitari Sant Joan D'Alacant","ror":"https://ror.org/00f6kbf47","country_code":"ES","type":"healthcare","lineage":["https://openalex.org/I4210091477"]},{"id":"https://openalex.org/I130194489","display_name":"University of Alicante","ror":"https://ror.org/05t8bcz72","country_code":"ES","type":"education","lineage":["https://openalex.org/I130194489"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Mikel L. Forcada","raw_affiliation_strings":["Dep. de Llenguatges i Sistemes Inform\u00e1tics, Universitat d\u2019Alacant, 03071, Alacant, Spain","Universitat d\u2019Alacant, Dep. de Llenguatges i Sistemes Inform\u00e1tics, 03071, Alacant, Spain#TAB#"],"affiliations":[{"raw_affiliation_string":"Dep. de Llenguatges i Sistemes Inform\u00e1tics, Universitat d\u2019Alacant, 03071, Alacant, Spain","institution_ids":["https://openalex.org/I4210091477"]},{"raw_affiliation_string":"Universitat d\u2019Alacant, Dep. de Llenguatges i Sistemes Inform\u00e1tics, 03071, Alacant, Spain#TAB#","institution_ids":["https://openalex.org/I130194489"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040165184"],"corresponding_institution_ids":["https://openalex.org/I130194489"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0644,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86165296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"55","issue":"1","first_page":"95","last_page":"110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9995999932289124,"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.9955999851226807,"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/T11269","display_name":"Algorithms and Data Compression","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7054446935653687},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7048131227493286},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6322741508483887},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5287284851074219},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.5194089412689209},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5032526850700378},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.48630818724632263},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.46103906631469727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4299355745315552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42796117067337036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4196639955043793},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41904163360595703},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35982733964920044},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3534046709537506},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3195952773094177},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.29125720262527466},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.26920759677886963},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07863256335258484}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7054446935653687},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7048131227493286},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6322741508483887},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5287284851074219},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5194089412689209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5032526850700378},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.48630818724632263},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.46103906631469727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4299355745315552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42796117067337036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4196639955043793},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41904163360595703},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35982733964920044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3534046709537506},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3195952773094177},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.29125720262527466},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26920759677886963},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07863256335258484},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-008-9172-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9172-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.379.7597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.7597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://altea.dlsi.ua.es/~mlf/docum/carrasco08j.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W361987422","https://openalex.org/W421997344","https://openalex.org/W1517895754","https://openalex.org/W1544575850","https://openalex.org/W1593799327","https://openalex.org/W1768003599","https://openalex.org/W1989111810","https://openalex.org/W2002089154","https://openalex.org/W2016995838","https://openalex.org/W2052395110","https://openalex.org/W2057772584","https://openalex.org/W2084345521","https://openalex.org/W2102351893","https://openalex.org/W2123135686","https://openalex.org/W2134683501","https://openalex.org/W2154478838","https://openalex.org/W2162539697","https://openalex.org/W2337480916","https://openalex.org/W2561675875","https://openalex.org/W3037477934","https://openalex.org/W4285719527","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2073530240","https://openalex.org/W2406489341","https://openalex.org/W2150988524","https://openalex.org/W2343659340","https://openalex.org/W2373110020","https://openalex.org/W2117415331","https://openalex.org/W2107019070","https://openalex.org/W2122253589","https://openalex.org/W3034799230","https://openalex.org/W1969183341"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}