{"id":"https://openalex.org/W2067385660","doi":"https://doi.org/10.1142/s0218196703001262","title":"ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON","display_name":"ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON","publication_year":2003,"publication_date":"2003-04-01","ids":{"openalex":"https://openalex.org/W2067385660","doi":"https://doi.org/10.1142/s0218196703001262","mag":"2067385660"},"language":"en","primary_location":{"id":"doi:10.1142/s0218196703001262","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196703001262","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","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/A5031246698","display_name":"Maurice Margenstern","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115482","display_name":"Laboratoire d'\u00c9tude des Microstructures et de M\u00e9canique des Mat\u00e9riaux","ror":"https://ror.org/01nyrrx14","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I190752583","https://openalex.org/I190861549","https://openalex.org/I4210095849","https://openalex.org/I4210115482","https://openalex.org/I4210134562","https://openalex.org/I4210150706","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"MAURICE MARGENSTERN","raw_affiliation_strings":["LITA, EA 3097, UFR MIM,  Universit\u00e9 de Metz, Ile du Saulcy, 57045 Metz Cedex, France"],"affiliations":[{"raw_affiliation_string":"LITA, EA 3097, UFR MIM,  Universit\u00e9 de Metz, Ile du Saulcy, 57045 Metz Cedex, France","institution_ids":["https://openalex.org/I4210115482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043126352","display_name":"LIOUDMILA PAVLOTSKA\u00cfA","orcid":null},"institutions":[{"id":"https://openalex.org/I171241948","display_name":"Moscow Power Engineering Institute","ror":"https://ror.org/05sa6gg87","country_code":"RU","type":"education","lineage":["https://openalex.org/I171241948"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"LIOUDMILA PAVLOTSKA\u00cfA","raw_affiliation_strings":["Moscow Power Engineering Institute, Russia","[Moscow Power Engineering Institute, Russia]"],"affiliations":[{"raw_affiliation_string":"Moscow Power Engineering Institute, Russia","institution_ids":["https://openalex.org/I171241948"]},{"raw_affiliation_string":"[Moscow Power Engineering Institute, Russia]","institution_ids":["https://openalex.org/I171241948"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031246698"],"corresponding_institution_ids":["https://openalex.org/I4210115482"],"apc_list":null,"apc_paid":null,"fwci":0.3546,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.60599776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"02","first_page":"133","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12162","display_name":"Cellular Automata and Applications","score":0.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.8591785430908203},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7941231727600098},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6709728240966797},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.6050194501876831},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.580906331539154},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.5704196691513062},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.5571345686912537},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5475292801856995},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5265032649040222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.488710880279541},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.48832079768180847},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4751710295677185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.468833863735199},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.46792009472846985},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.46613427996635437},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.4415968060493469},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4260373115539551},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.41925477981567383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3827921748161316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3200070858001709},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.24279585480690002}],"concepts":[{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.8591785430908203},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7941231727600098},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6709728240966797},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.6050194501876831},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.580906331539154},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.5704196691513062},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.5571345686912537},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5475292801856995},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5265032649040222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.488710880279541},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.48832079768180847},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4751710295677185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.468833863735199},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.46792009472846985},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.46613427996635437},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.4415968060493469},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4260373115539551},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.41925477981567383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3827921748161316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3200070858001709},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.24279585480690002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218196703001262","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196703001262","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","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":8,"referenced_works":["https://openalex.org/W85833935","https://openalex.org/W1644181480","https://openalex.org/W1983334035","https://openalex.org/W2012140001","https://openalex.org/W2134468631","https://openalex.org/W2155294253","https://openalex.org/W4233220581","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W165822490","https://openalex.org/W1978271909","https://openalex.org/W2539931802","https://openalex.org/W2067385660","https://openalex.org/W55259022","https://openalex.org/W1968553685","https://openalex.org/W3144533538","https://openalex.org/W1513977925","https://openalex.org/W2077599699","https://openalex.org/W1989382950"],"abstract_inverted_index":{"In":[0,32,73],"this":[1],"paper,":[2,38],"a":[3,11,15,33,45,58,74],"new":[4],"computation":[5,65,103],"system":[6],"is":[7,26,40,44,54,66,81,104],"defined":[8],"by":[9],"coupling":[10],"finite":[12,59,95],"automaton":[13,60,96],"with":[14,19,48],"deterministic":[16],"Turing":[17,46,71,86],"machine":[18,47,87],"one":[20,23,29],"head":[21],"and":[22],"tape":[24],"that":[25,42,62,83],"infinite":[27],"in":[28],"direction":[30],"only.":[31],"first":[34],"part":[35,76],"of":[36,77,100],"the":[37,63,78,85,94,98,101],"it":[39,53,80],"shown":[41,82],"there":[43],"five":[49],"instructions":[50],"for":[51],"which":[52],"possible":[55],"to":[56,68],"devise":[57],"such":[61],"resulting":[64,102],"able":[67],"simulate":[69],"any":[70],"machine.":[72],"second":[75],"paper":[79],"if":[84],"has":[88],"at":[89],"most":[90],"four":[91],"instructions,":[92],"whatever":[93],"is,":[97],"halting":[99],"always":[105],"decidable.":[106]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}