{"id":"https://openalex.org/W2050966373","doi":"https://doi.org/10.1142/s0129054111008106","title":"SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES","display_name":"SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES","publication_year":2011,"publication_date":"2011-02-01","ids":{"openalex":"https://openalex.org/W2050966373","doi":"https://doi.org/10.1142/s0129054111008106","mag":"2050966373"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054111008106","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008106","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/A5112642829","display_name":"Holger Petersen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"HOLGER PETERSEN","raw_affiliation_strings":["Reinsburgstra\u00dfe 75, D-70197, Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reinsburgstra\u00dfe 75, D-70197, Stuttgart, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112642829"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2941,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83862383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"02","first_page":"395","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7830963134765625},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5648452043533325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5536990165710449},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5198608040809631},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5096063613891602},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4832404553890228},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4680808484554291},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45059216022491455},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4450845718383789},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4397715628147125},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.4165993928909302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4095180332660675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3245782256126404}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7830963134765625},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5648452043533325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5536990165710449},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5198608040809631},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5096063613891602},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4832404553890228},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4680808484554291},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45059216022491455},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4450845718383789},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4397715628147125},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.4165993928909302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4095180332660675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3245782256126404},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054111008106","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008106","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":10,"referenced_works":["https://openalex.org/W134387435","https://openalex.org/W134510267","https://openalex.org/W1968497788","https://openalex.org/W2013544047","https://openalex.org/W2056647002","https://openalex.org/W2061970672","https://openalex.org/W2075742699","https://openalex.org/W2078378888","https://openalex.org/W2094003799","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1481279691","https://openalex.org/W1571113811","https://openalex.org/W1980837654","https://openalex.org/W1989903304","https://openalex.org/W2792625648","https://openalex.org/W2952282291","https://openalex.org/W1501939853","https://openalex.org/W2126291394","https://openalex.org/W1488148209","https://openalex.org/W2151536080"],"abstract_inverted_index":{"We":[0,69,119],"investigate":[1],"the":[2,23,27,89,115,149,163],"efficiency":[3],"of":[4,6,13,29,31,58,61,67,91,103,129,151,165],"simulations":[5,57],"storages":[7],"by":[8,63],"several":[9],"counters.":[10,68],"A":[11],"simulation":[12,75],"a":[14,32,46,59,64,73,100,108,126],"pushdown":[15],"store":[16],"is":[17,20],"described":[18],"which":[19],"optimal":[21],"in":[22,38,50,76,94,168],"sense":[24],"that":[25,82],"reducing":[26],"number":[28,66,128],"counters":[30,62,87,130,160],"simulator":[33],"leads":[34],"to":[35,56],"an":[36,142],"increase":[37],"time":[39,95,172],"complexity.":[40],"The":[41],"lower":[42],"bound":[43],"also":[44,120],"establishes":[45],"tight":[47,109],"counter":[48,140],"hierarchy":[49,110],"exponential":[51],"time.":[52,78,155],"Then":[53],"we":[54,105,147],"turn":[55],"set":[60],"different":[65],"improve":[70],"and":[71,131,141,153,170],"generalize":[72],"known":[74],"polynomial":[77,117,134],"Greibach":[79],"has":[80],"shown":[81],"adding":[83],"s":[84,97],"+":[85],"1":[86],"increases":[88],"power":[90],"machines":[92,113,124,137],"working":[93],"n":[96],".":[98],"Using":[99],"new":[101],"family":[102],"languages":[104,166],"show":[106],"here":[107],"result":[111],"for":[112,123],"with":[114,125,132,138],"same":[116],"time-bound.":[118],"prove":[121],"hierarchies":[122],"fixed":[127],"growing":[133],"time-bounds.":[135],"For":[136],"one":[139],"additional":[143],"\"store":[144],"zero\"":[145],"instruction":[146],"establish":[148],"equivalence":[150],"real-time":[152,169],"linear":[154,171],"If":[156],"at":[157],"least":[158],"two":[159],"are":[161],"available,":[162],"classes":[164],"accepted":[167],"can":[173],"be":[174],"separated.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}