{"id":"https://openalex.org/W2612746308","doi":"https://doi.org/10.23638/lmcs-13(1:16)2017","title":"Minimisation of Multiplicity Tree Automata","display_name":"Minimisation of Multiplicity Tree Automata","publication_year":2017,"publication_date":"2017-03-28","ids":{"openalex":"https://openalex.org/W2612746308","doi":"https://doi.org/10.23638/lmcs-13(1:16)2017","mag":"2612746308"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(1:16)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:16)2017","pdf_url":"https://lmcs.episciences.org/3224/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3224/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054782057","display_name":"Stefan Kiefer","orcid":"https://orcid.org/0000-0003-4173-6877"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Stefan Kiefer","raw_affiliation_strings":["University of Oxford , UK","University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford , UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014376569","display_name":"Ines Maru\u0161i\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ines Marusic","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068165188","display_name":"James Worrell","orcid":"https://orcid.org/0000-0001-8151-2443"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Worrell","raw_affiliation_strings":["University of Oxford , UK","University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford , UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054782057"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.237,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54886044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 13, Issue 1","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.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5647947788238525},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5591182112693787},{"id":"https://openalex.org/keywords/minimisation","display_name":"Minimisation (clinical trials)","score":0.4762692153453827},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.453592985868454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3104172945022583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3062115013599396},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06973105669021606}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5647947788238525},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5591182112693787},{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.4762692153453827},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.453592985868454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3104172945022583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3062115013599396},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06973105669021606}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(1:16)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:16)2017","pdf_url":"https://lmcs.episciences.org/3224/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1410.5352","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1410.5352","pdf_url":"https://arxiv.org/pdf/1410.5352","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:eeb82073ffe44591818747afdf715129","is_oa":true,"landing_page_url":"https://doaj.org/article/eeb82073ffe44591818747afdf715129","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 13, Issue 1 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(1:16)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:16)2017","pdf_url":"https://lmcs.episciences.org/3224/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.800000011920929}],"awards":[{"id":"https://openalex.org/G1361938442","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2674840903","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2612746308.pdf","grobid_xml":"https://content.openalex.org/works/W2612746308.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W78173020","https://openalex.org/W144407630","https://openalex.org/W1527197079","https://openalex.org/W1544575850","https://openalex.org/W1546312364","https://openalex.org/W1626880919","https://openalex.org/W1860547055","https://openalex.org/W1968245619","https://openalex.org/W1973940327","https://openalex.org/W1984151763","https://openalex.org/W1987028886","https://openalex.org/W1988572171","https://openalex.org/W2017205387","https://openalex.org/W2017603160","https://openalex.org/W2019789808","https://openalex.org/W2027671360","https://openalex.org/W2040721698","https://openalex.org/W2040834199","https://openalex.org/W2052395110","https://openalex.org/W2056133231","https://openalex.org/W2059144133","https://openalex.org/W2063209591","https://openalex.org/W2067754486","https://openalex.org/W2068264871","https://openalex.org/W2072239058","https://openalex.org/W2074691862","https://openalex.org/W2075835272","https://openalex.org/W2080132708","https://openalex.org/W2113097540","https://openalex.org/W2154932389","https://openalex.org/W2158914086","https://openalex.org/W4213269876","https://openalex.org/W4245153043"],"related_works":["https://openalex.org/W1582302366","https://openalex.org/W1548463674","https://openalex.org/W3174875281","https://openalex.org/W2096488839","https://openalex.org/W2610542549","https://openalex.org/W2124122503","https://openalex.org/W2953470554","https://openalex.org/W3021510591","https://openalex.org/W1586583492","https://openalex.org/W1577306287"],"abstract_inverted_index":{"We":[0,21,34,124],"consider":[1,98],"the":[2,6,16,42,51,60,67,77,80,99,133,137],"problem":[3,62,129],"of":[4,8,18,53,70,79,119,136,145],"minimising":[5,92],"number":[7],"states":[9,110],"in":[10,28,41,50,82,155,158],"a":[11,23,38,48,115,146],"multiplicity":[12,83,93],"tree":[13],"automaton":[14,107],"over":[15],"field":[17],"rational":[19],"numbers.":[20],"give":[22,87],"minimisation":[24],"algorithm":[25,90],"that":[26,37,59,111,126],"runs":[27],"polynomial":[29,39,54],"time":[30],"assuming":[31],"unit-cost":[32],"arithmetic.":[33],"also":[35,75],"show":[36,125],"bound":[40],"standard":[43],"Turing":[44],"model":[45],"would":[46],"require":[47],"breakthrough":[49],"complexity":[52],"identity":[55],"testing":[56],"by":[57],"proving":[58],"latter":[61],"is":[63,112,130],"logspace":[64],"equivalent":[65],"to":[66,152],"decision":[68,128],"version":[69,166],"minimisation.":[71],"The":[72],"developed":[73],"techniques":[74],"improve":[76],"state":[78],"art":[81],"word":[84,94],"automata:":[85],"we":[86,97],"an":[88,106],"NC":[89],"for":[91,132,140,143],"automata.":[95],"Finally,":[96],"minimal":[100],"consistency":[101],"problem:":[102],"does":[103],"there":[104],"exist":[105],"with":[108,114],"$n$":[109],"consistent":[113],"given":[116],"finite":[117],"sample":[118],"weight-labelled":[120],"words":[121,141],"or":[122],"trees?":[123],"this":[127],"complete":[131],"existential":[134],"theory":[135],"rationals,":[138],"both":[139],"and":[142],"trees":[144],"fixed":[147],"alphabet":[148],"rank.":[149],"Comment:":[150],"Paper":[151],"be":[153],"published":[154],"Logical":[156],"Methods":[157],"Computer":[159],"Science.":[160],"Minor":[161],"editing":[162],"changes":[163],"from":[164],"previous":[165]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}