{"id":"https://openalex.org/W2146347399","doi":"https://doi.org/10.1142/s012905410500339x","title":"NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES","display_name":"NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W2146347399","doi":"https://doi.org/10.1142/s012905410500339x","mag":"2146347399"},"language":"en","primary_location":{"id":"doi:10.1142/s012905410500339x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410500339x","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/A5023928618","display_name":"Christos A. Kapoutsis","orcid":"https://orcid.org/0000-0001-8963-9326"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"CHRISTOS KAPOUTSIS","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023928618"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.3514,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63593938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"05","first_page":"943","last_page":"956"},"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.9988999962806702,"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.9979000091552734,"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/unary-operation","display_name":"Unary operation","score":0.8587387800216675},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.67365562915802},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.6624724268913269},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.596969485282898},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5764807462692261},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5487266182899475},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5061637759208679},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5001366138458252},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.48624125123023987},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4740859270095825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44246286153793335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39283281564712524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37612104415893555},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37021273374557495}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8587387800216675},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.67365562915802},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6624724268913269},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.596969485282898},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5764807462692261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5487266182899475},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5061637759208679},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5001366138458252},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.48624125123023987},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4740859270095825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44246286153793335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39283281564712524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37612104415893555},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37021273374557495},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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.1142/s012905410500339x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410500339x","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":24,"referenced_works":["https://openalex.org/W134387435","https://openalex.org/W146895349","https://openalex.org/W1609236127","https://openalex.org/W1968302689","https://openalex.org/W1979381272","https://openalex.org/W1981789328","https://openalex.org/W1985677568","https://openalex.org/W1999147218","https://openalex.org/W2002089154","https://openalex.org/W2008388355","https://openalex.org/W2012140001","https://openalex.org/W2017429883","https://openalex.org/W2050612755","https://openalex.org/W2054801208","https://openalex.org/W2056647002","https://openalex.org/W2061970672","https://openalex.org/W2064465758","https://openalex.org/W2090921231","https://openalex.org/W2094856502","https://openalex.org/W2102296501","https://openalex.org/W2165700161","https://openalex.org/W2401199737","https://openalex.org/W4240212378","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1428391281","https://openalex.org/W2355522437","https://openalex.org/W4232890137","https://openalex.org/W1981823970","https://openalex.org/W2111868903","https://openalex.org/W127357700","https://openalex.org/W4281261571","https://openalex.org/W2724597727","https://openalex.org/W1480528870","https://openalex.org/W4312340169"],"abstract_inverted_index":{"If":[0],"the":[1,46,49],"machines":[2],"of":[3,17,51,56,65],"some":[4],"type":[5,18,57,66],"A":[6,58],"have":[7],"enough":[8],"resources":[9],"to":[10,34],"(i)":[11],"solve":[12],"problems":[13],"that":[14,31],"no":[15,40],"machine":[16,55,64],"B":[19],"can":[20,43],"solve,":[21],"and":[22],"(ii)":[23],"simulate":[24],"any":[25],"unary":[26],"two-way":[27],"deterministic":[28],"finite":[29],"automaton":[30],"has":[32],"access":[33],"a":[35,54],"linearly-bounded":[36],"counter,":[37],"then":[38],"typically":[39],"recursive":[41],"function":[42],"upper":[44],"bound":[45],"increase":[47],"in":[48],"size":[50],"description":[52],"when":[53],"is":[59],"replaced":[60],"by":[61],"an":[62],"equivalent":[63],"B.":[67]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}