{"id":"https://openalex.org/W2963214527","doi":"https://doi.org/10.1109/lics.2017.8005111","title":"Register automata with linear arithmetic","display_name":"Register automata with linear arithmetic","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2963214527","doi":"https://doi.org/10.1109/lics.2017.8005111","mag":"2963214527"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","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/A5048614307","display_name":"Yu\u2010Fang Chen","orcid":"https://orcid.org/0000-0003-2872-0336"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yu-Fang Chen","raw_affiliation_strings":["Academia Sinica, Institute of Information Science, Taiwan"],"affiliations":[{"raw_affiliation_string":"Academia Sinica, Institute of Information Science, Taiwan","institution_ids":["https://openalex.org/I4210098366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063557188","display_name":"Ond\u0159ej Leng\u00e1l","orcid":"https://orcid.org/0000-0002-3038-5875"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ondrej Lengal","raw_affiliation_strings":["FIT, Brno University of Technology, Czech Republic"],"affiliations":[{"raw_affiliation_string":"FIT, Brno University of Technology, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060686021","display_name":"Tony Tan","orcid":"https://orcid.org/0009-0005-8341-2004"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tony Tan","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100381605","display_name":"Zhilin Wu","orcid":"https://orcid.org/0000-0003-0899-628X"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhilin Wu","raw_affiliation_strings":["Chinese Academy of Sciences, Institute of Software, China"],"affiliations":[{"raw_affiliation_string":"Chinese Academy of Sciences, Institute of Software, China","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048614307"],"corresponding_institution_ids":["https://openalex.org/I4210098366"],"apc_list":null,"apc_paid":null,"fwci":1.1837067,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78286934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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.998199999332428,"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.6099716424942017},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.5719893574714661},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.5624318718910217},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5005254745483398},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4796786308288574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46940338611602783},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.45381540060043335},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.43743881583213806},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42338958382606506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3663399815559387},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.336778461933136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3123900890350342}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6099716424942017},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.5719893574714661},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.5624318718910217},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5005254745483398},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4796786308288574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46940338611602783},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.45381540060043335},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.43743881583213806},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42338958382606506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3663399815559387},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.336778461933136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3123900890350342}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2017.8005111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W122051056","https://openalex.org/W205218531","https://openalex.org/W582682133","https://openalex.org/W830367993","https://openalex.org/W1147533053","https://openalex.org/W1518247129","https://openalex.org/W1542510688","https://openalex.org/W1554005697","https://openalex.org/W1561337879","https://openalex.org/W1580943896","https://openalex.org/W1970398023","https://openalex.org/W1984151763","https://openalex.org/W2012140001","https://openalex.org/W2026388351","https://openalex.org/W2026944800","https://openalex.org/W2031373197","https://openalex.org/W2038404317","https://openalex.org/W2040721698","https://openalex.org/W2043100293","https://openalex.org/W2056665285","https://openalex.org/W2061970672","https://openalex.org/W2071846104","https://openalex.org/W2081396910","https://openalex.org/W2081806129","https://openalex.org/W2082366872","https://openalex.org/W2096729377","https://openalex.org/W2101508170","https://openalex.org/W2116976042","https://openalex.org/W2145794448","https://openalex.org/W2157148396","https://openalex.org/W2164003033","https://openalex.org/W2167906874","https://openalex.org/W2168206938","https://openalex.org/W2177814128","https://openalex.org/W2345428211","https://openalex.org/W2523048084","https://openalex.org/W2561427878","https://openalex.org/W2963214527","https://openalex.org/W4210596830","https://openalex.org/W4240267080","https://openalex.org/W4242157899","https://openalex.org/W4251691259","https://openalex.org/W6604914529","https://openalex.org/W6681439208","https://openalex.org/W6683223886"],"related_works":["https://openalex.org/W2150468037","https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W4288581691","https://openalex.org/W1999231617","https://openalex.org/W1507516107","https://openalex.org/W1494870752","https://openalex.org/W2520067680"],"abstract_inverted_index":{"We":[0,147],"propose":[1],"a":[2,27,59],"novel":[3],"automata":[4,16,48,56],"model":[5,77,97],"over":[6,17,50],"the":[7,18,45,69,72,104,131,136,142,173],"alphabet":[8],"of":[9,29,44,62,123,133,141],"rational":[10,30,35],"numbers,":[11],"which":[12,53],"we":[13],"call":[14],"register":[15,47],"rationals":[19],"(RA":[20],"<sub":[21,38,74,125,162],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,39,75,126,163],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u211a</sub>":[23,40,76,127,164],").":[24],"It":[25],"reads":[26],"sequence":[28],"numbers":[31],"and":[32,81,117,157,167],"outputs":[33],"another":[34],"number.":[36],"RA":[37,73,124,161],"is":[41,98,128],"an":[42],"extension":[43],"well-known":[46,111],"(RA)":[49],"infinite":[51],"alphabets,":[52],"are":[54,169],"finite":[55,60],"equipped":[57],"with":[58,172],"number":[61],"registers/variables":[63],"for":[64],"storing":[65],"values.":[66,85],"Like":[67],"in":[68,101],"standard":[70,105,143],"RA,":[71,106],"allows":[78,88],"both":[79],"equality":[80],"ordering":[82],"tests":[83],"between":[84,93],"It,":[86],"moreover,":[87],"to":[89,103],"perform":[90],"linear":[91,134],"arithmetic":[92,118],"certain":[94],"variables.":[95],"The":[96,120],"quite":[99],"expressive:":[100],"addition":[102],"it":[107],"also":[108,148],"generalizes":[109],"other":[110,150],"models":[112],"such":[113],"as":[114],"affine":[115],"programs":[116],"circuits.":[119],"main":[121],"feature":[122],"that":[129],"despite":[130],"use":[132],"arithmetic,":[135],"so-called":[137],"invariant":[138,174],"problem-a":[139],"generalization":[140],"non-emptiness":[144],"problem-is":[145],"decidable.":[146],"investigate":[149],"natural":[151],"decision":[152],"problems,":[153],"namely,":[154],"commutativity,":[155],"equivalence,":[156],"reachability.":[158],"For":[159],"deterministic":[160],",":[165],"commutativity":[166],"equivalence":[168],"polynomial-time":[170],"inter-reducible":[171],"problem.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}