{"id":"https://openalex.org/W2097880459","doi":"https://doi.org/10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","display_name":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2097880459","doi":"https://doi.org/10.1142/s0129054112400035","mag":"2097880459"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112400035","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400035","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/A5079186295","display_name":"Cristian S. Calude","orcid":"https://orcid.org/0000-0002-8711-6799"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"CRISTIAN S. CALUDE","raw_affiliation_strings":["Department of Computer Science, University of Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"KAI SALOMAA","raw_affiliation_strings":["School of Computing, Queen's University, Kingston, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Queen's University, Kingston, Ontario, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077531315","display_name":"Tania Roblot","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"TANIA K. ROBLOT","raw_affiliation_strings":["Department of Computer Science, University of Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0419,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78439008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"01","first_page":"37","last_page":"50"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/hierarchy","display_name":"Hierarchy","score":0.8019320964813232},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.7045910358428955},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.6632511615753174},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6486700177192688},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5897368788719177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5680716037750244},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5200973749160767},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5038987994194031},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.49618273973464966},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48752638697624207},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.48441511392593384},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47171279788017273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4510481059551239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38099128007888794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28313732147216797},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.18961545825004578},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.17005255818367004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06503823399543762}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.8019320964813232},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.7045910358428955},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.6632511615753174},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6486700177192688},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5897368788719177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5680716037750244},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5200973749160767},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5038987994194031},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.49618273973464966},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48752638697624207},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.48441511392593384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47171279788017273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4510481059551239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38099128007888794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28313732147216797},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.18961545825004578},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.17005255818367004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06503823399543762},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054112400035","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400035","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1505482284","https://openalex.org/W1969367179","https://openalex.org/W2003926749","https://openalex.org/W2043927415","https://openalex.org/W2075025003","https://openalex.org/W2154904467","https://openalex.org/W3093654831","https://openalex.org/W4206503652","https://openalex.org/W4211010176","https://openalex.org/W4238159413","https://openalex.org/W4255316878"],"related_works":["https://openalex.org/W2298795566","https://openalex.org/W1750180674","https://openalex.org/W1761397873","https://openalex.org/W87572417","https://openalex.org/W1808977091","https://openalex.org/W4235638761","https://openalex.org/W1487573642","https://openalex.org/W2168723754","https://openalex.org/W2040069378","https://openalex.org/W4254505348"],"abstract_inverted_index":{"Finite-state":[0],"complexity":[1],"is":[2,49],"a":[3,46,65],"variant":[4],"of":[5,21,30,72],"algorithmic":[6],"information":[7],"theory":[8],"obtained":[9],"by":[10,56],"replacing":[11],"Turing":[12],"machines":[13],"with":[14,43],"finite":[15],"transducers.":[16],"We":[17,51],"consider":[18,52],"the":[19,40,73],"number":[20],"states":[22],"needed":[23],"for":[24,64],"transducers":[25],"used":[26],"in":[27],"minimal":[28],"descriptions":[29],"arbitrary":[31],"strings":[32],"and,":[33],"as":[34],"our":[35],"main":[36],"result,":[37],"show":[38],"that":[39,63],"state-size":[41,74],"hierarchy":[42,75],"respect":[44],"to":[45],"standard":[47],"encoding":[48,69],"infinite.":[50],"corresponding":[53],"hierarchies":[54],"yielded":[55],"more":[57],"general":[58],"computable":[59,68],"encodings":[60],"and":[61],"establish":[62],"suitably":[66],"chosen":[67],"every":[70],"level":[71],"can":[76],"be":[77],"strict.":[78]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
