{"id":"https://openalex.org/W1566043677","doi":"https://doi.org/10.25596/jalc-2002-351","title":"More on Generalized Automatic Sequences","display_name":"More on Generalized Automatic Sequences","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1566043677","doi":"https://doi.org/10.25596/jalc-2002-351","mag":"1566043677"},"language":"en","primary_location":{"id":"pmh:oai:orbi.ulg.ac.be:2268/15843","is_oa":false,"landing_page_url":"https://orbi.uliege.be/handle/2268/15843","pdf_url":null,"source":{"id":"https://openalex.org/S4306401300","display_name":"ORBi (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata, Languages and Combinatorics, 7, 351-376 (2002)","raw_type":"peer reviewed"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2002-351","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027485931","display_name":"Michel Rigo","orcid":"https://orcid.org/0000-0001-7463-8507"},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Rigo, Michel","raw_affiliation_strings":["Institut de Math\u00e9matiques, Universit\u00e9 de Li\u00e8ge, Grande Traverse 12 (B37), B-4000 Li\u00e8ge, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matiques, Universit\u00e9 de Li\u00e8ge, Grande Traverse 12 (B37), B-4000 Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051623653","display_name":"Arnaud Maes","orcid":null},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Maes, Arnaud","raw_affiliation_strings":["Institut de Math\u00e9matique et d'Informatique, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6 (Le Pentagone), B-7000 Mons, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matique et d'Informatique, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6 (Le Pentagone), B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3499,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.53404275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9950000047683716,"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.9799000024795532,"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/closure","display_name":"Closure (psychology)","score":0.7028358578681946},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6616133451461792},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6373240351676941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5015652179718018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44344109296798706},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3622061610221863},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34852367639541626},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14613723754882812}],"concepts":[{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7028358578681946},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6616133451461792},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6373240351676941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5015652179718018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44344109296798706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3622061610221863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34852367639541626},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14613723754882812},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:orbi.ulg.ac.be:2268/15843","is_oa":false,"landing_page_url":"https://orbi.uliege.be/handle/2268/15843","pdf_url":null,"source":{"id":"https://openalex.org/S4306401300","display_name":"ORBi (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automata, Languages and Combinatorics, 7, 351-376 (2002)","raw_type":"peer reviewed"},{"id":"doi:10.25596/jalc-2002-351","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-351","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-351","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-351","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1489341787","https://openalex.org/W1580591826","https://openalex.org/W1965601284","https://openalex.org/W1976293483","https://openalex.org/W1990014377","https://openalex.org/W1994728128","https://openalex.org/W2002089154","https://openalex.org/W2003927948","https://openalex.org/W2081147560","https://openalex.org/W2083770519","https://openalex.org/W2127757588","https://openalex.org/W2324549590","https://openalex.org/W2538477359"],"related_works":["https://openalex.org/W1489341787","https://openalex.org/W2003927948","https://openalex.org/W1990014377","https://openalex.org/W2075879364","https://openalex.org/W2163696969","https://openalex.org/W2030999998","https://openalex.org/W1976293483","https://openalex.org/W1565611252","https://openalex.org/W1586417893","https://openalex.org/W2009934988","https://openalex.org/W2538477359","https://openalex.org/W2011086484","https://openalex.org/W1584451387","https://openalex.org/W67338565","https://openalex.org/W2487809102","https://openalex.org/W2324549590","https://openalex.org/W1998927893","https://openalex.org/W1972767918","https://openalex.org/W118064341","https://openalex.org/W1514324498"],"abstract_inverted_index":{"We":[0,20],"give":[1],"some":[2,22],"generalizations":[3],"of":[4,23,27,44],"$k$-automatic":[5],"sequences":[6,29,46],"replacing":[7],"the":[8,24,31,35,53],"$k$-ary":[9],"system":[10,15],"by":[11],"an":[12],"abstract":[13],"numeration":[14],"on":[16],"a":[17],"regular":[18],"language.":[19],"study":[21],"closure":[25],"properties":[26],"these":[28,45],"and":[30,47,52],"possible":[32],"extension":[33],"to":[34,39,55],"multidimensional":[36],"case":[37],"or":[38],"infinite":[40],"alphabets.":[41],"The":[42],"equivalence":[43],"morphic":[48],"predicates":[49],"is":[50,57],"given":[51],"relationship":[54],"recognizability":[56],"also":[58],"investigated.":[59]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}