乐胖代购免代理版

{"id":"https://openalex.org/W2066393902","doi":"https://doi.org/10.1142/s0129054112500244","title":"JUMPING FINITE AUTOMATA","display_name":"JUMPING FINITE AUTOMATA","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2066393902","doi":"https://doi.org/10.1142/s0129054112500244","mag":"2066393902"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112500244","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5009693719","display_name":"Alexander Meduna","orcid":"https://orcid.org/0000-0002-2341-0606"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"ALEXANDER MEDUNA","raw_affiliation_strings":["Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1/2, 612 66 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1/2, 612 66 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031228172","display_name":"Petr Zemek","orcid":null},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"PETR ZEMEK","raw_affiliation_strings":["Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1/2, 612 66 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bo\u017eet\u011bchova 1/2, 612 66 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.881,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":79,"citation_normalized_percentile":{"value":0.96831,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"23","issue":"07","first_page":"1555","last_page":"1578"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9999,"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.9999,"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.9996,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983,"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/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.78890014},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6195605},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.50551367},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.48938888},{"id":"https://openalex.org/keywords/continuous-spatial-automaton","display_name":"Continuous spatial automaton","score":0.4319967}],"concepts":[{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.7958596},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.78890014},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6916493},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.63660926},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6195605},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.60976017},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.60675836},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6020465},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5585358},{"id":"https://openalex.org/C2779897013","wikidata":"https://www.wikidata.org/wiki/Q1151752","display_name":"Jumping","level":2,"score":0.52375317},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.50551367},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.48938888},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.47111607},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.4319967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4257561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41841978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32329875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31484988},{"id":"https://openalex.org/C42407357","wikidata":"https://www.wikidata.org/wiki/Q521","display_name":"Physiology","level":1,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112500244","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W1483313504","https://openalex.org/W1484522079","https://openalex.org/W1495745428","https://openalex.org/W2010039268","https://openalex.org/W2041518499","https://openalex.org/W2100532597","https://openalex.org/W2102459127","https://openalex.org/W2116509046","https://openalex.org/W2131886132","https://openalex.org/W2151033407","https://openalex.org/W2263798363","https://openalex.org/W2914032487","https://openalex.org/W4233469922","https://openalex.org/W4256103224","https://openalex.org/W4285719527","https://openalex.org/W78534653"],"related_works":["https://openalex.org/W4386400090","https://openalex.org/W4382203044","https://openalex.org/W4310283533","https://openalex.org/W4205935260","https://openalex.org/W2368684504","https://openalex.org/W2173305072","https://openalex.org/W2169203237","https://openalex.org/W2066393902","https://openalex.org/W2012286375","https://openalex.org/W1975910189"],"abstract_inverted_index":{"The":[0,51],"present":[1],"paper":[2,52,96],"proposes":[3],"a":[4,34],"new":[5],"investigation":[6,104],"area":[7],"in":[8,60],"automata":[9,16,21,59,67,87],"theory":[10],"\u2014":[11,29],"jumping":[12,57,85],"finite":[13,20,58,86,90],"automata.":[14,91],"These":[15],"work":[17],"like":[18],"classical":[19,89],"except":[22],"that":[23,30,81],"they":[24,36],"read":[25],"input":[26],"words":[27,44],"discontinuously":[28],"is,":[31],"after":[32],"reading":[33],"symbol,":[35],"can":[37],"jump":[38],"over":[39],"some":[40],"symbols":[41],"within":[42],"the":[43,95],"and":[45,72,88,101],"continue":[46],"their":[47],"computation":[48],"from":[49],"there.":[50],"establishes":[53],"several":[54,79,98],"results":[55,80],"concerning":[56],"terms":[61],"of":[62,66],"commonly":[63],"investigated":[64],"areas":[65],"theory,":[68],"such":[69],"as":[70],"decidability":[71],"closure":[73],"properties.":[74],"Most":[75],"importantly,":[76],"it":[77],"achieves":[78],"demonstrate":[82],"differences":[83],"between":[84],"In":[92],"its":[93],"conclusion,":[94],"formulates":[97],"open":[99],"problems":[100],"suggests":[102],"future":[103],"areas.":[105]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2066393902","counts_by_year":[{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-04-19T07:11:59.258519","created_date":"2016-06-24"}