{"id":"https://openalex.org/W2146441371","doi":"https://doi.org/10.1142/s0129054114400103","title":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","display_name":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2146441371","doi":"https://doi.org/10.1142/s0129054114400103","mag":"2146441371"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400103","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400103","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/A5040124658","display_name":"Daniel Go\u010d","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"DANIEL GO\u010c","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","School of Computer Science,#N# University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"School of Computer Science,#N# University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012711207","display_name":"Alexandros Palioudakis","orcid":null},"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":"ALEXANDROS PALIOUDAKIS","raw_affiliation_strings":["School of Computing, Queen\u02bcs University, Kingston, Ontario K7L 3N6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u02bcs University, Kingston, Ontario K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","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\u02bcs University, Kingston, Ontario K7L 3N6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u02bcs University, Kingston, Ontario K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040124658"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65099789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"07","first_page":"823","last_page":"835"},"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.9973999857902527,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.80329829454422},{"id":"https://openalex.org/keywords/monomial","display_name":"Monomial","score":0.6645115613937378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6482784748077393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6041167974472046},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5886381268501282},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5718585848808289},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5534659028053284},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5422344207763672},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5132801532745361},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4770592749118805},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4763484299182892},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47622162103652954},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4500761330127716},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.4169521927833557},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4008267819881439},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3537464439868927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16727644205093384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1166052520275116},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.09250673651695251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08788132667541504}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.80329829454422},{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.6645115613937378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6482784748077393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6041167974472046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5886381268501282},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5718585848808289},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5534659028053284},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5422344207763672},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5132801532745361},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4770592749118805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4763484299182892},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47622162103652954},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4500761330127716},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.4169521927833557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4008267819881439},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3537464439868927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16727644205093384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1166052520275116},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.09250673651695251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08788132667541504},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114400103","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400103","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1963890729","https://openalex.org/W1971747251","https://openalex.org/W2000290048","https://openalex.org/W2006629323","https://openalex.org/W2008342226","https://openalex.org/W2011252827","https://openalex.org/W2040834199","https://openalex.org/W2088578754","https://openalex.org/W2133585348","https://openalex.org/W2149288970","https://openalex.org/W2165700161"],"related_works":["https://openalex.org/W1531056015","https://openalex.org/W4233053549","https://openalex.org/W1505947458","https://openalex.org/W2098066196","https://openalex.org/W2024358852","https://openalex.org/W1563292958","https://openalex.org/W2033718868","https://openalex.org/W236032","https://openalex.org/W1676587966","https://openalex.org/W1495098865"],"abstract_inverted_index":{"The":[0],"language":[1],"[Formula:":[2,47],"see":[3,48],"text]":[4,49],"consists":[5],"of":[6,9,16,30,44,53,80,96],"first":[7],"halfs":[8],"strings":[10],"in":[11,24,88],"L.":[12],"Many":[13],"other":[14],"variants":[15],"a":[17,28,84,94,97,100],"proportional":[18],"removal":[19,31],"operation":[20,46],"have":[21],"been":[22],"considered":[23],"the":[25,40,45,76,91,104],"literature":[26],"and":[27,63,83,99],"characterization":[29],"operations":[32],"that":[33],"preserve":[34],"regularity":[35],"is":[36,93],"known.":[37],"We":[38,67],"consider":[39],"nondeterministic":[41,77],"state":[42,78],"complexity":[43,79],"and,":[50],"more":[51],"generally,":[52],"polynomial":[54,81,92,105],"removals":[55,82],"as":[56],"defined":[57],"by":[58],"Domaratzki":[59],"(J.":[60],"Automata,":[61],"Languages":[62],"Combinatorics":[64],"7(4),":[65],"2002).":[66],"give":[68],"an":[69],"O(n":[70],"2":[71],")":[72],"upper":[73],"bound":[74,87],"for":[75],"matching":[85],"lower":[86],"cases":[89],"where":[90],"sum":[95],"monomial":[98],"constant,":[101],"or":[102],"when":[103],"has":[106],"rational":[107],"roots.":[108]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}