{"id":"https://openalex.org/W3094532315","doi":"https://doi.org/10.1142/s0129054120410063","title":"Decidability of Right One-Way Jumping Finite Automata","display_name":"Decidability of Right One-Way Jumping Finite Automata","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3094532315","doi":"https://doi.org/10.1142/s0129054120410063","mag":"3094532315"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054120410063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120410063","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/A5029376436","display_name":"Simon Beier","orcid":null},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Simon Beier","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029376436"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.1407,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53818119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"06","first_page":"805","last_page":"825"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9926000237464905,"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/decidability","display_name":"Decidability","score":0.7954357862472534},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7484638094902039},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.6045641899108887},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.5641891956329346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5477296113967896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5180104374885559},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.49973225593566895},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4984571933746338},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4933535158634186},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4840914011001587},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4766595959663391},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4762033224105835},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4354850947856903},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.41871362924575806},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.41863399744033813},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40924984216690063},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.34901514649391174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3000298738479614},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2304384410381317},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22907006740570068}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7954357862472534},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7484638094902039},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.6045641899108887},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.5641891956329346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5477296113967896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5180104374885559},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.49973225593566895},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4984571933746338},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4933535158634186},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4840914011001587},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4766595959663391},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4762033224105835},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4354850947856903},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.41871362924575806},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.41863399744033813},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40924984216690063},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.34901514649391174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3000298738479614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2304384410381317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22907006740570068},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054120410063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120410063","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/16","score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W162242831","https://openalex.org/W1132487926","https://openalex.org/W1590283810","https://openalex.org/W1930502691","https://openalex.org/W1964874178","https://openalex.org/W2002944460","https://openalex.org/W2043360684","https://openalex.org/W2066393902","https://openalex.org/W2157390113","https://openalex.org/W2188913344","https://openalex.org/W2415435980","https://openalex.org/W2738441772","https://openalex.org/W2865126090","https://openalex.org/W2963905619","https://openalex.org/W2964077628","https://openalex.org/W3100227670","https://openalex.org/W4240128381"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W2368684504","https://openalex.org/W4386400090","https://openalex.org/W2037872771","https://openalex.org/W1993598446","https://openalex.org/W1987608226","https://openalex.org/W2462239665","https://openalex.org/W2124370744","https://openalex.org/W2171527505"],"abstract_inverted_index":{"We":[0],"continue":[1],"our":[2],"investigation":[3],"[S.":[4],"Beier,":[5],"M.":[6],"Holzer:":[7],"Properties":[8],"of":[9,30,80,87,96],"right":[10],"one-way":[11,23],"jumping":[12,24,31,107],"finite":[13,25,108],"automata.":[14],"In":[15],"Proc.":[16],"20th":[17],"DCFS,":[18],"LNCS,":[19],"2018]":[20],"on":[21,45],"(right)":[22],"automata":[26,109],"(ROWJFAs),":[27],"a":[28,81],"variant":[29],"automata,":[32],"which":[33],"is":[34,116],"an":[35],"automaton":[36],"model":[37],"for":[38,48,126,144],"discontinuous":[39],"information":[40],"processing.":[41],"Here":[42],"we":[43,75,123,138],"focus":[44],"decision":[46,147],"problems":[47,55],"ROWJFAs.":[49],"It":[50],"turns":[51],"out":[52],"that":[53,77,125],"most":[54],"such":[56],"as,":[57],"e.g.,":[58],"emptiness,":[59],"finiteness,":[60],"universality,":[61],"the":[62,78,84,94,120,130,145],"word":[63],"problem":[64,134],"and":[65],"variants":[66],"thereof,":[67],"closure":[68],"under":[69],"permutation,":[70],"etc.,":[71],"are":[72],"decidable.":[73],"Moreover,":[74,137],"show":[76],"containment":[79],"language":[82],"within":[83],"strict":[85],"hierarchy":[86],"ROWJFA":[88,132],"permutation":[89,103],"closed":[90,104],"languages":[91,110,129],"induced":[92],"by":[93,114],"number":[95],"accepting":[97],"states":[98],"as":[99,101],"well":[100],"whether":[102],"regular":[105],"or":[106],"can":[111],"be":[112],"accepted":[113],"ROWJFAs":[115],"decidable,":[117],"too.":[118],"On":[119],"other":[121],"hand,":[122],"prove":[124],"(linear)":[127],"context-free":[128],"corresponding":[131],"acceptance":[133],"becomes":[135],"undecidable.":[136],"discuss":[139],"also":[140],"some":[141],"complexity":[142],"results":[143],"considered":[146],"problems.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}