{"id":"https://openalex.org/W4412419876","doi":"https://doi.org/10.46298/lmcs-21(3:3)2025","title":"The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)","display_name":"The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)","publication_year":2025,"publication_date":"2025-07-15","ids":{"openalex":"https://openalex.org/W4412419876","doi":"https://doi.org/10.46298/lmcs-21(3:3)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(3:3)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:3)2025","pdf_url":"https://lmcs.episciences.org/16042/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16042/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022959189","display_name":"Laure Daviaud","orcid":"https://orcid.org/0000-0002-9220-7118"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Laure Daviaud","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013804239","display_name":"David Purser","orcid":"https://orcid.org/0000-0003-0394-1634"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Purser","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5118987317","display_name":"Marie Tcheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marie Tcheng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022959189"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18212453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 3","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.9926999807357788,"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.9926999807357788,"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.9907000064849854,"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/T10237","display_name":"Cryptography and Data Security","score":0.9907000064849854,"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/decidability","display_name":"Decidability","score":0.7549142837524414},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7284263968467712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.522954523563385},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5022001266479492},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4360799789428711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3875010907649994},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38066115975379944},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2966168522834778},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2772493362426758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2178543210029602}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7549142837524414},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7284263968467712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.522954523563385},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5022001266479492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4360799789428711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3875010907649994},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38066115975379944},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2966168522834778},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2772493362426758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2178543210029602}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(3:3)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:3)2025","pdf_url":"https://lmcs.episciences.org/16042/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:ueaeprints.uea.ac.uk:99069","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:doaj.org/article:846ac5ea0cc34a198b761649e337c29e","is_oa":true,"landing_page_url":"https://doaj.org/article/846ac5ea0cc34a198b761649e337c29e","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 3 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(3:3)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:3)2025","pdf_url":"https://lmcs.episciences.org/16042/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":[],"awards":[{"id":"https://openalex.org/G2256139321","display_name":"Learning, Approximating and Minimising Streaming Automata for Large-scale Optimisation","funder_award_id":"EP/T018313/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412419876.pdf","grobid_xml":"https://content.openalex.org/works/W4412419876.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2109489765","https://openalex.org/W2506746226","https://openalex.org/W3104737963","https://openalex.org/W2182252111","https://openalex.org/W1490074134","https://openalex.org/W1892058059","https://openalex.org/W2951545071","https://openalex.org/W2440791454","https://openalex.org/W4297670065"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,36,71],"the":[3,46],"big-O":[4,14],"problem":[5,18,48],"for":[6],"max-plus":[7,23],"automata":[8,24],"is":[9,42,55],"decidable":[10],"and":[11,28,65,85],"PSPACE-complete.":[12],"The":[13],"(or":[15],"affine":[16],"domination)":[17],"asks":[19],"whether,":[20],"given":[21],"two":[22,81],"computing":[25],"functions":[26],"f":[27,37,51],"g,":[29,53],"there":[30],"exists":[31],"a":[32,43,76],"constant":[33],"c":[34],"such":[35],"<":[38,52],"cg+":[39],"c.":[40],"This":[41],"relaxation":[44],"of":[45],"containment":[47],"asking":[49],"whether":[50],"which":[54],"undecidable.":[56],"Our":[57],"decidability":[58],"result":[59],"uses":[60],"Simon's":[61],"forest":[62],"factorisation":[63],"theorem,":[64],"relies":[66],"on":[67],"detecting":[68],"specific":[69],"elements,":[70],"we":[72],"call":[73],"witnesses,":[74],"in":[75],"finite":[77],"semigroup":[78],"closed":[79],"under":[80],"special":[82],"operations:":[83],"stabilisation":[84],"flattening.":[86]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}