{"id":"https://openalex.org/W2592986310","doi":"https://doi.org/10.23638/lmcs-15(3:8)2019","title":"An efficient algorithm to decide periodicity of $b$-recognisable sets using LSDF convention","display_name":"An efficient algorithm to decide periodicity of $b$-recognisable sets using LSDF convention","publication_year":2019,"publication_date":"2019-07-31","ids":{"openalex":"https://openalex.org/W2592986310","doi":"https://doi.org/10.23638/lmcs-15(3:8)2019","mag":"2592986310"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(3:8)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:8)2019","pdf_url":"https://lmcs.episciences.org/5656/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5656/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013208252","display_name":"Victor Marsault","orcid":"https://orcid.org/0000-0002-2325-6004"},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Victor Marsault","raw_affiliation_strings":["Laboratoire d'Informatique Gaspard-Monge"],"raw_orcid":"https://orcid.org/0000-0002-2325-6004","affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique Gaspard-Monge","institution_ids":["https://openalex.org/I4210152518"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013208252"],"corresponding_institution_ids":["https://openalex.org/I4210152518"],"apc_list":null,"apc_paid":null,"fwci":0.2,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49418497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 15, 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":1.0,"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":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6135988235473633},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6051046848297119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5808120965957642},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5767640471458435},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5719711184501648},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5331294536590576},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5150632262229919},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.5138607025146484},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.439081609249115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18277594447135925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15629243850708008}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6135988235473633},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6051046848297119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5808120965957642},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5767640471458435},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5719711184501648},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5331294536590576},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5150632262229919},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.5138607025146484},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.439081609249115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18277594447135925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15629243850708008},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(3:8)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:8)2019","pdf_url":"https://lmcs.episciences.org/5656/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:1708.06228","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1708.06228","pdf_url":"https://arxiv.org/pdf/1708.06228","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1708.06228","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1708.06228","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(3:8)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:8)2019","pdf_url":"https://lmcs.episciences.org/5656/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":[{"display_name":"Peace, Justice and strong institutions","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320323329","display_name":"Universit\u00e9 de Li\u00e8ge","ror":"https://ror.org/00afp2z80"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2592986310.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W118064341","https://openalex.org/W1489341787","https://openalex.org/W1531140751","https://openalex.org/W1540012118","https://openalex.org/W1566043677","https://openalex.org/W1584451387","https://openalex.org/W1592957478","https://openalex.org/W1617936625","https://openalex.org/W1722971898","https://openalex.org/W1964874178","https://openalex.org/W1998927893","https://openalex.org/W2131742729","https://openalex.org/W2135463032","https://openalex.org/W2163696969","https://openalex.org/W2570053645","https://openalex.org/W2570386222","https://openalex.org/W2626087725","https://openalex.org/W2963494353","https://openalex.org/W2963820659","https://openalex.org/W3145128584","https://openalex.org/W3176136019"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2182252111","https://openalex.org/W1974025154","https://openalex.org/W2070262843"],"abstract_inverted_index":{"Let":[0],"$b$":[1,18],"be":[2,34,80,168],"an":[3,191,197],"integer":[4],"strictly":[5],"greater":[6],"than":[7],"$1$.":[8],"Each":[9],"set":[10,30,65,82,200],"of":[11,83,154,201],"nonnegative":[12,84,202],"integers":[13,85],"is":[14,31,38,45,66,87,100,110],"represented":[15,39],"in":[16,68,105,116,170],"base":[17,55,70],"by":[19,40],"a":[20,41,81,91,133,138,151,174,184],"language":[21],"over":[22,94],"$\\{0,":[23],"1,":[24],"\\dots,":[25,96],"b":[26,97],"-":[27,98],"1\\}$.":[28],"The":[29],"said":[32],"to":[33,120,136,188],"$b$-recognisable":[35,67],"if":[36,173],"it":[37,166],"regular":[42],"language.":[43],"It":[44],"known":[46],"that":[47,86,107,158,165],"ultimately":[48,198],"periodic":[49,160,199],"sets":[50],"are":[51],"$b$-recognisable,":[52,88],"for":[53],"every":[54,69],"$b$,":[56],"and":[57,131,149],"Cobham's":[58],"theorem":[59],"implies":[60],"the":[61,74,118,125,155],"converse:":[62],"no":[63],"other":[64],"$b$.":[71],"We":[72,142],"consider":[73],"following":[75],"decision":[76],"problem:":[77],"let":[78],"$S$":[79,101],"given":[89],"as":[90,147],"finite":[92],"automaton":[93,176,192],"$\\{0,1,":[95],"1\\}$,":[99],"periodic?":[102],"Honkala":[103],"showed":[104],"1986":[106],"this":[108,178,182],"problem":[109],"decidable.":[111],"Later":[112],"on,":[113],"Leroux":[114],"used":[115],"2005":[117],"convention":[119,146],"write":[121],"number":[122],"representations":[123],"with":[124,193],"least":[126],"significant":[127],"digit":[128],"first":[129],"(LSDF),":[130],"designed":[132],"quadratic":[134],"algorithm":[135],"solve":[137],"more":[139],"general":[140],"problem.":[141],"use":[143],"here":[144],"LSDF":[145],"well":[148],"give":[150],"structural":[152],"description":[153],"minimal":[156,175],"automata":[157],"accept":[159],"sets.":[161],"Then,":[162],"we":[163],"show":[164],"can":[167],"verified":[169],"linear":[171],"time":[172],"meets":[177],"description.":[179],"In":[180],"general,":[181],"yields":[183],"$O(b":[185],"\\log(n))$":[186],"procedure":[187],"decide":[189],"whether":[190],"$n$":[194],"states":[195],"accepts":[196],"integers.":[203]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}