{"id":"https://openalex.org/W2085033370","doi":"https://doi.org/10.1016/0304-3975(83)90091-9","title":"The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications","display_name":"The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2085033370","doi":"https://doi.org/10.1016/0304-3975(83)90091-9","mag":"2085033370"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(83)90091-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90091-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical 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/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H.B. Hunt","raw_affiliation_strings":["Computer Science Department, State University of New York at Albany, Albany, NY 12222, U.S.A","Computer Science Department State University of New York at Albany, Albany, NY 12222 U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, State University of New York at Albany, Albany, NY 12222, U.S.A","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]},{"raw_affiliation_string":"Computer Science Department State University of New York at Albany, Albany, NY 12222 U.S.A","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.J. Rosenkrantz","raw_affiliation_strings":["Computer Science Department, State University of New York at Albany, Albany, NY 12222, U.S.A","Computer Science Department State University of New York at Albany, Albany, NY 12222 U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, State University of New York at Albany, Albany, NY 12222, U.S.A","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]},{"raw_affiliation_string":"Computer Science Department State University of New York at Albany, Albany, NY 12222 U.S.A","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086835651"],"corresponding_institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.5673,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66632189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"1-2","first_page":"3","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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.9994999766349792,"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.9954000115394592,"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/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/recursion","display_name":"Recursion (computer science)","score":0.7583004236221313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6919237971305847},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6301958560943604},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5444745421409607},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5259806513786316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4838055968284607},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.47631654143333435},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4694252610206604},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.46773630380630493},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.449263334274292},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.432274729013443},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4301043450832367},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4267463684082031},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.32699424028396606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2346564531326294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1979934275150299},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17183056473731995}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7583004236221313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6919237971305847},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6301958560943604},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5444745421409607},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5259806513786316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4838055968284607},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.47631654143333435},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4694252610206604},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.46773630380630493},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.449263334274292},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.432274729013443},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4301043450832367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4267463684082031},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32699424028396606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2346564531326294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1979934275150299},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17183056473731995},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":1,"locations":[{"id":"doi:10.1016/0304-3975(83)90091-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90091-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W193181283","https://openalex.org/W1655990431","https://openalex.org/W1963980186","https://openalex.org/W1982129592","https://openalex.org/W2009721064","https://openalex.org/W2016313399","https://openalex.org/W2024886091","https://openalex.org/W2028140996","https://openalex.org/W2046796873","https://openalex.org/W2054468579","https://openalex.org/W2167358968","https://openalex.org/W6663853935"],"related_works":["https://openalex.org/W2299982751","https://openalex.org/W2085484366","https://openalex.org/W2591371812","https://openalex.org/W2024994589","https://openalex.org/W1981914472","https://openalex.org/W1535953883","https://openalex.org/W1504200807","https://openalex.org/W2296061337","https://openalex.org/W278676640","https://openalex.org/W2029632316"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}