{"id":"https://openalex.org/W2972213460","doi":"https://doi.org/10.1007/978-3-030-30806-3_11","title":"On the Termination Problem for Counter Machines with Incrementing Errors","display_name":"On the Termination Problem for Counter Machines with Incrementing Errors","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2972213460","doi":"https://doi.org/10.1007/978-3-030-30806-3_11","mag":"2972213460"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-30806-3_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30806-3_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/ws/files/116392471/main.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084460588","display_name":"Christopher Hampson","orcid":"https://orcid.org/0000-0002-6111-9465"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Christopher Hampson","raw_affiliation_strings":["Department of Informatics, King\u2019s College, London, UK","Department of Informatics, King's College, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, King\u2019s College, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084460588"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.4893,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67056784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"137","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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.9994999766349792,"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.9987000226974487,"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.9973999857902527,"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/undecidable-problem","display_name":"Undecidable problem","score":0.836207389831543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6855651140213013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5195403695106506},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4795472323894501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3455487787723541},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2997061610221863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2851254343986511},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.1448425054550171}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.836207389831543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6855651140213013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5195403695106506},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4795472323894501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3455487787723541},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2997061610221863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2851254343986511},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.1448425054550171}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-30806-3_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30806-3_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/87ceb73d-325c-4580-949f-484f38f45676","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/87ceb73d-325c-4580-949f-484f38f45676","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/116392471/main.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hampson , C S 2019 , On the termination problem for counter machines with incrementing errors . in E Filiot , R Jungers & I Potapov (eds) , Reachability Problems - 13th International Conference, RP 2019, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11674 LNCS , pp. 137-148 . https://doi.org/10.1007/978-3-030-30806-3_11","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/87ceb73d-325c-4580-949f-484f38f45676","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/87ceb73d-325c-4580-949f-484f38f45676","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/116392471/main.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hampson , C S 2019 , On the termination problem for counter machines with incrementing errors . in E Filiot , R Jungers & I Potapov (eds) , Reachability Problems - 13th International Conference, RP 2019, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11674 LNCS , pp. 137-148 . https://doi.org/10.1007/978-3-030-30806-3_11","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2972213460.pdf","grobid_xml":"https://content.openalex.org/works/W2972213460.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1508360721","https://openalex.org/W1580995538","https://openalex.org/W1590283810","https://openalex.org/W1775249002","https://openalex.org/W1982129592","https://openalex.org/W1985925577","https://openalex.org/W1989887898","https://openalex.org/W2022782983","https://openalex.org/W2043360684","https://openalex.org/W2053229198","https://openalex.org/W2083176536","https://openalex.org/W2123160677","https://openalex.org/W2142270469","https://openalex.org/W2160527279","https://openalex.org/W2177814128","https://openalex.org/W2399815048","https://openalex.org/W3098270706","https://openalex.org/W3123793150","https://openalex.org/W3125224867"],"related_works":["https://openalex.org/W1786478901","https://openalex.org/W1528032490","https://openalex.org/W4295847115","https://openalex.org/W1563786920","https://openalex.org/W4288634121","https://openalex.org/W4297670065","https://openalex.org/W1618267488","https://openalex.org/W2909826889","https://openalex.org/W2056142535","https://openalex.org/W3209732136"],"abstract_inverted_index":{"In":[0],"contrast":[1],"to":[2,28,57],"their":[3],"reliable":[4],"and":[5],"lossy-error":[6],"counterparts":[7],"whose":[8,52],"termination":[9,18,53,76],"problems":[10],"are":[11],"either":[12],"undecidable":[13],"or":[14],"non-primitive":[15],"recursive,":[16],"the":[17,63,75],"problem":[19,54],"for":[20,74],"counter":[21],"machines":[22],"with":[23],"incrementing":[24],"errors":[25],"is":[26,37,55],"shown":[27],"be":[29,58],"PSpace-hard":[30],"but":[31],"remains":[32],"solvable":[33],"in":[34,41],"ExpSpace.":[35],"This":[36],"a":[38,70],"notable":[39],"decrease":[40],"complexity":[42],"over":[43],"that":[44],"of":[45,65],"insertion-error":[46],"channel":[47],"systems":[48],"(with":[49],"emptiness":[50],"testing)":[51],"known":[56],"non-elementary.":[59],"Furthermore,":[60],"by":[61],"fixing":[62],"number":[64],"available":[66],"counters,":[67],"we":[68],"obtain":[69],"tight":[71],"NLogSpace-complete":[72],"bound":[73],"problem.":[77]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}