{"id":"https://openalex.org/W6945898360","doi":"https://doi.org/10.25596/jalc-2022-131","title":"Complexities for Jumps and Sweeps","display_name":"Complexities for Jumps and Sweeps","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6945898360","doi":"https://doi.org/10.25596/jalc-2022-131"},"language":"en","primary_location":{"id":"pmh:oai:figshare.com:article/19336454","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fazekas, Szil\u00e1rd Zsolt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fazekas, Szil\u00e1rd Zsolt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Merca\u0219, Robert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Merca\u0219, Robert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Wu, Olivia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Olivia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6085,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72257499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9200999736785889,"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.9200999736785889,"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.024000000208616257,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.020600000396370888,"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/jumping","display_name":"Jumping","score":0.84579998254776},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.597000002861023},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5878000259399414},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.560699999332428},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5587999820709229},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.526199996471405},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.47350001335144043},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4717000126838684},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.4544999897480011}],"concepts":[{"id":"https://openalex.org/C2779897013","wikidata":"https://www.wikidata.org/wiki/Q1151752","display_name":"Jumping","level":2,"score":0.84579998254776},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.597000002861023},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.560699999332428},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5587999820709229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5548999905586243},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.526199996471405},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4544999897480011},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44269999861717224},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.3882000148296356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3686000108718872},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36550000309944153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32249999046325684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30709999799728394},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.30239999294281006},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.2930999994277954},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.2800999879837036},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2531000077724457},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:figshare.com:article/19336454","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.25596/jalc-2022-131","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2022-131","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/19336454","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,45],"recently":[1],"introduced":[2],"model":[3,114],"of":[4,21,52,57,64,85,112,118,146,153],"one-way":[5,154],"jumping":[6,54,94,104,127,155],"finite":[7,43],"automata":[8],"skips":[9],"over":[10,55],"letters":[11],"for":[12,109],"which":[13],"it":[14,36],"does":[15],"not":[16],"have":[17],"defined":[18],"transitions":[19],"instead":[20],"halting":[22],"and":[23,66,92],"rejecting":[24],"as":[25,33],"classical":[26,42],"machines":[27,65,124,156],"do.":[28],"It":[29],"is":[30,37,73,101,122],"known":[31],"that":[32,99,108],"an":[34],"acceptor":[35],"strictly":[38],"more":[39],"powerful":[40],"than":[41],"automata.":[44],"extra":[46],"power":[47],"comes":[48],"from":[49],"the":[50,58,83,86,89,113,116,119,147],"ability":[51],"temporarily":[53],"parts":[56],"input.":[59],"Here":[60],"we":[61],"define":[62],"classes":[63],"their":[67],"accepted":[68],"languages":[69],"when":[70],"this":[71],"resource":[72],"bounded":[74],"asymptotically,":[75],"similar":[76],"to":[77,140,143],"computational":[78],"complexity":[79,95,105,128,137],"classes.":[80,96],"We":[81,97,130],"initiate":[82],"study":[84],"gap":[87],"between":[88],"resulting":[90],"constant":[91],"linear":[93],"conjecture":[98],"there":[100],"no":[102],"intermediate":[103],"but":[106],"show":[107],"a":[110,133,144],"restriction":[111],"where":[115],"length":[117],"jumped-over":[120],"factors":[121],"limited,":[123],"with":[125,157],"logarithmic":[126],"exist.":[129],"also":[131],"introduce":[132],"measure":[134],"called":[135],"sweep":[136],"in":[138,151],"order":[139],"get":[141],"closer":[142],"characterization":[145],"regular":[148],"language":[149],"class":[150],"terms":[152],"limited":[158],"resources.":[159]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}