{"id":"https://openalex.org/W2920575637","doi":"https://doi.org/10.1142/s012905411940001x","title":"Operational State Complexity and Decidability of Jumping Finite Automata","display_name":"Operational State Complexity and Decidability of Jumping Finite Automata","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2920575637","doi":"https://doi.org/10.1142/s012905411940001x","mag":"2920575637"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411940001x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940001x","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, Arndtstrasse 2, 35392 Giessen, Germany"],"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/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, Arndtstrasse 2, 35392 Giessen, Germany"],"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/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"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":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, 35392 Giessen, Germany"],"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/A5029376436"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6123148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"01","first_page":"5","last_page":"27"},"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.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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/decidability","display_name":"Decidability","score":0.8050422668457031},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6766952276229858},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.561643123626709},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5506637692451477},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5474668741226196},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5299488306045532},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.5125996470451355},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4518347680568695},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.437274307012558},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.418554425239563},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.41741666197776794},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.41717734932899475},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3977949321269989},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.3910679817199707},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.20224404335021973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18191245198249817},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1751159429550171},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16905111074447632}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8050422668457031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6766952276229858},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.561643123626709},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5506637692451477},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5474668741226196},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5299488306045532},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.5125996470451355},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4518347680568695},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.437274307012558},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.418554425239563},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.41741666197776794},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.41717734932899475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3977949321269989},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3910679817199707},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.20224404335021973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18191245198249817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1751159429550171},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16905111074447632},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/s012905411940001x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940001x","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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W271776540","https://openalex.org/W421997344","https://openalex.org/W1132487926","https://openalex.org/W1483313504","https://openalex.org/W1582408114","https://openalex.org/W1589381382","https://openalex.org/W1630184508","https://openalex.org/W1988572171","https://openalex.org/W2007431032","https://openalex.org/W2022772583","https://openalex.org/W2050310895","https://openalex.org/W2066393902","https://openalex.org/W2089107726","https://openalex.org/W2162593546","https://openalex.org/W2260250184","https://openalex.org/W2275546263","https://openalex.org/W2316437449","https://openalex.org/W2745995963","https://openalex.org/W2963905619","https://openalex.org/W3100227670","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2003664089","https://openalex.org/W2810776027","https://openalex.org/W2091988401","https://openalex.org/W1990283467","https://openalex.org/W2037872771","https://openalex.org/W1983100634","https://openalex.org/W2404099564","https://openalex.org/W2408583837","https://openalex.org/W2243509623","https://openalex.org/W2139519154"],"abstract_inverted_index":{"We":[0],"consider":[1,102],"jumping":[2,16,116],"finite":[3,20,117],"automata":[4],"and":[5,10,34,59],"their":[6],"operational":[7],"state":[8],"complexity":[9],"decidability":[11,104],"status.":[12],"Roughly":[13],"speaking,":[14],"a":[15,19,23],"automaton":[17,21],"is":[18],"with":[22],"non-continuous":[24],"input.":[25],"This":[26],"device":[27],"has":[28],"nice":[29],"relations":[30],"to":[31,36],"semilinear":[32],"sets":[33],"thus":[35],"Parikh":[37,85],"images":[38],"of":[39,84,106],"regular":[40],"sets,":[41],"which":[42],"will":[43],"be":[44],"exhaustively":[45],"used":[46],"in":[47],"our":[48],"proofs.":[49],"In":[50],"particular,":[51],"we":[52,89,100],"prove":[53],"upper":[54,67],"bounds":[55],"on":[56,64,94],"the":[57,65,95,103],"intersection":[58],"complementation.":[60],"The":[61],"latter":[62],"result":[63,93],"complementation":[66],"bound":[68],"answers":[69],"an":[70,91],"open":[71],"problem":[72],"from":[73],"[G.":[74],"J.":[75],"Lavado,":[76],"G.":[77],"Pighizzini,":[78],"S.":[79],"Seki:":[80],"Operational":[81],"State":[82],"Complexity":[83],"Equivalence,":[86],"2014].":[87],"Moreover,":[88],"correct":[90],"erroneous":[92],"inverse":[96],"homomorphism":[97],"closure.":[98],"Finally,":[99],"also":[101],"status":[105],"standard":[107],"problems":[108],"as":[109],"regularity,":[110],"disjointness,":[111],"universality,":[112],"inclusion,":[113],"etc.":[114],"for":[115],"automata.":[118]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}