{"id":"https://openalex.org/W2888102682","doi":"https://doi.org/10.1142/s0129054118420066","title":"Degrees of Infinite Words, Polynomials and Atoms","display_name":"Degrees of Infinite Words, Polynomials and Atoms","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2888102682","doi":"https://doi.org/10.1142/s0129054118420066","mag":"2888102682"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118420066","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118420066","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","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/A5029479330","display_name":"J\u00f6rg Endrullis","orcid":"https://orcid.org/0000-0002-2554-8270"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"J\u00f6rg Endrullis","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085504322","display_name":"Juhani Karhum\u00e4ki","orcid":null},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Juhani Karhum\u00e4ki","raw_affiliation_strings":["Department of Mathematics and Statistics & FUNDIM, University of Turku, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics & FUNDIM, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110443113","display_name":"Jan Willem Klop","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jan Willem Klop","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Amsterdam, the Netherlands","Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031862611","display_name":"Aleksi Saarela","orcid":"https://orcid.org/0000-0002-6636-2317"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Aleksi Saarela","raw_affiliation_strings":["Department of Mathematics and Statistics & FUNDIM, University of Turku, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics & FUNDIM, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029479330"],"corresponding_institution_ids":["https://openalex.org/I865915315"],"apc_list":null,"apc_paid":null,"fwci":0.6308,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71472416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"05","first_page":"825","last_page":"843"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9948999881744385,"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.9943000078201294,"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/turing-machine","display_name":"Turing machine","score":0.6511029601097107},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5586435198783875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5352360010147095},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5245685577392578},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5104595422744751},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5039772391319275},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.46382537484169006},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.44454899430274963},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4344231188297272},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43222159147262573},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.42884716391563416},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.42822057008743286},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.42165717482566833},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.39740389585494995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37756308913230896},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3442356586456299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31099244952201843},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.29180142283439636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18265506625175476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16514793038368225},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.09036430716514587}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6511029601097107},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5586435198783875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5352360010147095},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5245685577392578},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5104595422744751},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5039772391319275},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.46382537484169006},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.44454899430274963},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4344231188297272},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43222159147262573},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.42884716391563416},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.42822057008743286},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.42165717482566833},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.39740389585494995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37756308913230896},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3442356586456299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31099244952201843},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.29180142283439636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18265506625175476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16514793038368225},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.09036430716514587},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"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/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054118420066","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118420066","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/96369ac0-0d55-4bfd-8b9a-e4221315ab94","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/96369ac0-0d55-4bfd-8b9a-e4221315ab94","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Endrullis, J, Karhum\u00e4ki, J, Klop, J W & Saarela, A 2018, 'Degrees of Infinite Words, Polynomials and Atoms', International Journal of Foundations of Computer Science, vol. 29, no. 5, pp. 825-843. https://doi.org/10.1142/S0129054118420066","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:27935","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/27935","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 29(5), 825 - 843","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research.vu.nl:publications/96369ac0-0d55-4bfd-8b9a-e4221315ab94","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85051933899&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Endrullis, J, Karhum\u00e4ki, J, Klop, J W & Saarela, A 2018, 'Degrees of Infinite Words, Polynomials and Atoms', International Journal of Foundations of Computer Science, vol. 29, no. 5, pp. 825-843. https://doi.org/10.1142/S0129054118420066","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6200000047683716}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W44111308","https://openalex.org/W1554654090","https://openalex.org/W1963878263","https://openalex.org/W2004570537","https://openalex.org/W2013287448","https://openalex.org/W2045574270","https://openalex.org/W2118672671","https://openalex.org/W2560042768","https://openalex.org/W4206411814","https://openalex.org/W4238159413","https://openalex.org/W4251222677"],"related_works":["https://openalex.org/W2156308118","https://openalex.org/W2037124586","https://openalex.org/W1838451616","https://openalex.org/W87572417","https://openalex.org/W2298795566","https://openalex.org/W1808977091","https://openalex.org/W1761397873","https://openalex.org/W4235638761","https://openalex.org/W2040069378","https://openalex.org/W4205400944"],"abstract_inverted_index":{"We":[0,159],"study":[1],"finite-state":[2,61],"transducers":[3,62,132],"and":[4,31,38,71,79,165],"their":[5,157],"power":[6,49],"for":[7,36],"transforming":[8,39],"infinite":[9,54],"words.":[10,55,130],"Infinite":[11],"sequences":[12],"of":[13,16,23,50,69,89,97,156],"symbols":[14],"are":[15,41,108,118,171],"paramount":[17],"importance":[18],"in":[19,154,175],"a":[20,66,80,113,136],"wide":[21],"range":[22],"fields,":[24],"from":[25,162],"formal":[26],"languages":[27,40],"to":[28,52,65,93,135,144,167],"pure":[29],"mathematics":[30],"physics.":[32],"While":[33],"finite":[34],"automata":[35,51],"recognising":[37],"well-understood,":[42],"very":[43],"little":[44],"is":[45,91,149],"known":[46,100,150],"about":[47,151],"the":[48,94,105,123,176],"transform":[53],"The":[56,86],"word":[57],"transformation":[58],"realised":[59],"by":[60,126],"gives":[63],"rise":[64,134],"complexity":[67,114],"comparison":[68],"words":[70],"thereby":[72],"induces":[73],"equivalence":[74],"classes,":[75],"called":[76],"(transducer)":[77],"degrees,":[78,103,146,153,178],"partial":[81],"order":[82],"on":[83],"these":[84],"degrees.":[85,183],"ensuing":[87],"hierarchy":[88],"degrees":[90,96],"analogous":[92],"recursion-theoretic":[95],"unsolvability,":[98],"also":[99],"as":[101,112],"Turing":[102,109,116,145],"where":[104],"transformational":[106],"devices":[107],"machines.":[110],"However,":[111],"measure,":[115],"machines":[117],"too":[119],"strong:":[120],"they":[121],"trivialise":[122],"classification":[124],"problem":[125],"identifying":[127],"all":[128],"computable":[129],"Finite-state":[131],"give":[133],"much":[137],"more":[138],"fine-grained,":[139],"discriminating":[140],"hierarchy.":[141],"In":[142],"contrast":[143],"hardly":[147],"anything":[148],"transducer":[152,177],"spite":[155],"naturality.":[158],"use":[160],"methods":[161],"linear":[163],"algebra":[164],"analysis":[166],"show":[168],"that":[169,179],"there":[170],"infinitely":[172],"many":[173],"atoms":[174],"is,":[180],"minimal":[181],"non-trivial":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}