{"id":"https://openalex.org/W189510061","doi":"https://doi.org/10.25596/jalc-2005-107","title":"Bounds for Tree Automata with Polynomial Costs","display_name":"Bounds for Tree Automata with Polynomial Costs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W189510061","doi":"https://doi.org/10.25596/jalc-2005-107","mag":"189510061"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.1969","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.1969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwtcs.inf.tu-dresden.de/~maletti/pub/borfulgazmal05.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2005-107","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064944715","display_name":"Bj\u00f6rn Borchardt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Borchardt, Bj\u00f6rn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061481182","display_name":"Zolt\u00e1n F\u00fcl\u00f6p","orcid":"https://orcid.org/0000-0002-3825-022X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F\u00fcl\u00f6p, Zolt\u00e1n","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071606442","display_name":"Zsolt Gazdag","orcid":"https://orcid.org/0000-0002-5617-8743"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gazdag, Zsolt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087927480","display_name":"Andreas Maletti","orcid":"https://orcid.org/0000-0003-3202-0498"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maletti, Andreas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3207,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.58422045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"107","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.998199999332428,"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.998199999332428,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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/T12029","display_name":"DNA and Biological Computing","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6071460247039795},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.58954256772995},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46063244342803955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45330724120140076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4328978657722473},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3729163408279419},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3716300129890442},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2695097327232361}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6071460247039795},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.58954256772995},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46063244342803955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45330724120140076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4328978657722473},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3729163408279419},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3716300129890442},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2695097327232361},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.1969","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.1969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwtcs.inf.tu-dresden.de/~maletti/pub/borfulgazmal05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.2014","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.2014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwtcs.inf.tu-dresden.de/~maletti/pub/borfulgazmal05.pdf","raw_type":"text"},{"id":"doi:10.25596/jalc-2005-107","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2005-107","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"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"},{"id":"mag:189510061","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc10.html#BorchardtFGM05","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2005-107","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2005-107","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W17932182","https://openalex.org/W2023899121","https://openalex.org/W2159332695","https://openalex.org/W3214156864","https://openalex.org/W151848869","https://openalex.org/W2158216775","https://openalex.org/W1230660382","https://openalex.org/W1929910776","https://openalex.org/W1536248371","https://openalex.org/W2100732817","https://openalex.org/W2165654745","https://openalex.org/W1983093782","https://openalex.org/W1783099167","https://openalex.org/W2897992026","https://openalex.org/W1612237203","https://openalex.org/W2278285357","https://openalex.org/W2329464395","https://openalex.org/W1584815367","https://openalex.org/W2724366454","https://openalex.org/W2963906838"],"abstract_inverted_index":{"We":[0,14,54],"consider":[1],"tree":[2,42,58,81,118],"automata":[3,43,59,119],"with":[4,44,60,83,96,120],"costs":[5,45,61,84,121],"over":[6,46,62,85,122],"semirings":[7,51],"in":[8],"the":[9,16,30,39,99,106,112,115,123,130],"sense":[10],"of":[11,18,24,32,41,108,114,117,126,133],"(Seidl,":[12,109],"1994).":[13],"define":[15],"concept":[17],"a":[19,25,80,86],"finitely":[20,47,63,87],"factorizing":[21,48,64],"semiring":[22,93,125],"and":[23,36,49,65,70,90,129],"monotonic":[26,50],"semiring,":[27],"both":[28],"as":[29],"generalization":[31],"well-known":[33],"particular":[34],"semirings,":[35,68],"show":[37,55],"that":[38],"costfiniteness":[40],"is":[52,76,94],"decidable.":[53],"that,":[56],"for":[57],"naturally":[66,91],"ordered":[67,92],"cost-finiteness":[69],"boundedness":[71,116],"are":[72],"equivalent.":[73],"Hence":[74],"it":[75],"also":[77],"decidable":[78],"whether":[79],"automaton":[82],"factorizing,":[88],"monotonic,":[89],"bounded":[95],"respect":[97],"to":[98],"natural":[100,127,134],"order.":[101],"With":[102],"this":[103],"we":[104],"generalize":[105],"results":[107],"1994)":[110],"concerning":[111],"decidability":[113],"classical":[124],"numbers":[128],"(max,":[131],"+)-semiring":[132],"numbers.":[135]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}