{"id":"https://openalex.org/W2047061522","doi":"https://doi.org/10.1142/s0129054113500329","title":"TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES","display_name":"TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2047061522","doi":"https://doi.org/10.1142/s0129054113500329","mag":"2047061522"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500329","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500329","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/A5002142749","display_name":"Abuzer Yakary\u0131lmaz","orcid":"https://orcid.org/0000-0002-2372-252X"},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":false,"raw_author_name":"ABUZER YAKARYILMAZ","raw_affiliation_strings":["Faculty of Computing, University of Latvia, Raina bulv. 19, Riga, LV-1586, Latvia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computing, University of Latvia, Raina bulv. 19, Riga, LV-1586, Latvia","institution_ids":["https://openalex.org/I91123046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060493020","display_name":"A. C. Cem Say","orcid":"https://orcid.org/0000-0002-4374-8460"},"institutions":[{"id":"https://openalex.org/I4405392","display_name":"Bo\u011fazi\u00e7i University","ror":"https://ror.org/03z9tma90","country_code":"TR","type":"education","lineage":["https://openalex.org/I4405392"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"A. C. CEM SAY","raw_affiliation_strings":["Department of Computer Engineering, Bo\u011fazi\u00e7i University, Bebek 34342, \u0130stanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Bo\u011fazi\u00e7i University, Bebek 34342, \u0130stanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0936,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78798367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"08","first_page":"1243","last_page":"1253"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6281354427337646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.599103569984436},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5764907598495483},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5078192353248596},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4913598597049713},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.48355600237846375},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4535575211048126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44234877824783325},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4375688433647156},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.43473875522613525},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4102945029735565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38790273666381836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3318888247013092},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3256686329841614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31216007471084595}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6281354427337646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599103569984436},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5764907598495483},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5078192353248596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4913598597049713},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.48355600237846375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4535575211048126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44234877824783325},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4375688433647156},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.43473875522613525},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4102945029735565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38790273666381836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3318888247013092},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3256686329841614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31216007471084595},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/s0129054113500329","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500329","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/4","display_name":"Quality Education","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W18030389","https://openalex.org/W65921681","https://openalex.org/W1496964377","https://openalex.org/W1978191224","https://openalex.org/W1984165512","https://openalex.org/W2055191062","https://openalex.org/W2057836657","https://openalex.org/W2063628628","https://openalex.org/W2076413258","https://openalex.org/W2090627896","https://openalex.org/W2091845976","https://openalex.org/W2140852079","https://openalex.org/W2164423904","https://openalex.org/W2533977282","https://openalex.org/W2644673415","https://openalex.org/W2964037983","https://openalex.org/W3098706366","https://openalex.org/W4212875940","https://openalex.org/W4242336842"],"related_works":["https://openalex.org/W1945859206","https://openalex.org/W4210507006","https://openalex.org/W2027925033","https://openalex.org/W2081160903","https://openalex.org/W2059442203","https://openalex.org/W1971747251","https://openalex.org/W22759520","https://openalex.org/W1607287758","https://openalex.org/W2595899102","https://openalex.org/W2407531803"],"abstract_inverted_index":{"We":[0,17],"examine":[1],"the":[2,46,55,75,89],"minimum":[3],"amount":[4,91],"of":[5,77,79,92],"memory":[6],"for":[7,49,61,95],"real-time,":[8],"as":[9],"opposed":[10],"to":[11,43],"one-way,":[12],"computation":[13],"accepting":[14],"nonregular":[15,62,96],"languages.":[16],"consider":[18],"deterministic,":[19],"nondeterministic":[20],"and":[21,28,31],"alternating":[22],"machines":[23,51],"working":[24],"within":[25],"strong,":[26],"middle":[27],"weak":[29],"space,":[30],"processing":[32],"general":[33],"or":[34],"unary":[35],"inputs.":[36],"In":[37],"most":[38],"cases,":[39],"we":[40],"are":[41,67],"able":[42],"show":[44],"that":[45,73],"lower":[47,59],"bounds":[48,60],"one-way":[50],"remain":[52],"tight":[53],"in":[54,85,88],"real-time":[56,80],"case.":[57],"Memory":[58],"acceptance":[63],"on":[64],"other":[65],"devices":[66],"also":[68],"addressed.":[69],"It":[70],"is":[71],"shown":[72],"increasing":[74],"number":[76],"stacks":[78],"pushdown":[81],"automata":[82],"can":[83],"result":[84],"exponential":[86],"improvement":[87],"total":[90],"space":[93],"usage":[94],"language":[97],"recognition.":[98]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}