{"id":"https://openalex.org/W2053370306","doi":"https://doi.org/10.1142/s0129054114400139","title":"SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA","display_name":"SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2053370306","doi":"https://doi.org/10.1142/s0129054114400139","mag":"2053370306"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400139","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400139","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/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MARTIN KUTRIB","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083650443","display_name":"Andreas Malcher","orcid":"https://orcid.org/0000-0002-9589-5833"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ANDREAS MALCHER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083635884","display_name":"Matthias Wendlandt","orcid":"https://orcid.org/0009-0001-2243-549X"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MATTHIAS WENDLANDT","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstrasse 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":1.1011,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78655852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"25","issue":"07","first_page":"877","last_page":"896"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9954000115394592,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9940000176429749,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7930654287338257},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7792365550994873},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6422293782234192},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6291811466217041},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5867753624916077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.586601734161377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5545748472213745},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.541839063167572},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4993600845336914},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.49625498056411743},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4746561646461487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4724852442741394},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.4670834541320801},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44935134053230286},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4191403388977051},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.39746806025505066},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3164035379886627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2511023283004761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19909685850143433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09405517578125}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7930654287338257},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7792365550994873},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6422293782234192},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6291811466217041},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5867753624916077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.586601734161377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5545748472213745},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.541839063167572},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4993600845336914},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.49625498056411743},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4746561646461487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4724852442741394},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.4670834541320801},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44935134053230286},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4191403388977051},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.39746806025505066},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3164035379886627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2511023283004761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19909685850143433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09405517578125},{"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/s0129054114400139","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400139","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W153129168","https://openalex.org/W173762137","https://openalex.org/W963086913","https://openalex.org/W1507575253","https://openalex.org/W1515528048","https://openalex.org/W1525645762","https://openalex.org/W1589494865","https://openalex.org/W1598118199","https://openalex.org/W1638203394","https://openalex.org/W1971747251","https://openalex.org/W1981823970","https://openalex.org/W1988560957","https://openalex.org/W1989887898","https://openalex.org/W2032543301","https://openalex.org/W2040161039","https://openalex.org/W2047588061","https://openalex.org/W2057559629","https://openalex.org/W2074307142","https://openalex.org/W2081149873","https://openalex.org/W2090921231","https://openalex.org/W2095117965","https://openalex.org/W2095282951","https://openalex.org/W2102296501","https://openalex.org/W2158448273","https://openalex.org/W2165700161","https://openalex.org/W2475482660","https://openalex.org/W2765801977","https://openalex.org/W2797767659","https://openalex.org/W3175367423","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W1975910189","https://openalex.org/W2368684504","https://openalex.org/W4386400090","https://openalex.org/W2371400076","https://openalex.org/W2030569822","https://openalex.org/W3143588635","https://openalex.org/W2160879187","https://openalex.org/W2057386223"],"abstract_inverted_index":{"We":[0,93],"investigate":[1,94],"the":[2,21,29,32,54,65,72,96,99,123,128,145],"descriptional":[3],"complexity":[4],"of":[5,31,34,67,80,88,101,131,136,144],"deterministic":[6,48,107,155],"one-way":[7],"multi-head":[8],"finite":[9,40,51,104,109,132,157],"automata":[10,105,158],"accepting":[11],"unary":[12,138,154],"languages.":[13],"It":[14],"is":[15,42],"known":[16],"that":[17,61,111,150],"in":[18,64,127,134],"this":[19],"case":[20,56,74,130],"languages":[22],"accepted":[23],"are":[24,62,69,164],"regular.":[25],"Thus,":[26],"we":[27,75,113,120,148],"study":[28,121],"increase":[30],"number":[33],"states":[35],"when":[36],"an":[37,77,142],"n-state":[38],"k-head":[39,108,156],"automaton":[41],"simulated":[43],"by":[44],"a":[45,85],"classical":[46],"(one-head)":[47],"or":[49,162],"nondeterministic":[50,103],"automaton.":[52],"In":[53,118],"former":[55],"upper":[57,78],"and":[58,84],"lower":[59,86],"bounds":[60],"tight":[63],"order":[66],"magnitude":[68],"shown.":[70],"For":[71],"latter":[73],"obtain":[76],"bound":[79,87],"O(n":[81],"2k":[82],")":[83,91],"\u03a9(n":[89],"k":[90],"states.":[92],"also":[95],"costs":[97,125],"for":[98,116,153],"conversion":[100,124],"one-head":[102],"to":[106],"automata,":[110],"is,":[112],"trade":[114],"nondeterminism":[115],"heads.":[117],"addition,":[119],"how":[122],"vary":[126],"special":[129],"and,":[133],"particular,":[135],"singleton":[137],"lanuages.":[139],"Finally,":[140],"as":[141,160],"application":[143],"simulation":[146],"results,":[147],"show":[149],"decidability":[151],"problems":[152],"such":[159],"emptiness":[161],"equivalence":[163],"LOGSPACE-complete.":[165]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}