{"id":"https://openalex.org/W2620566111","doi":"https://doi.org/10.1007/978-3-319-60252-3_18","title":"A Pumping Lemma for Ordered Restarting Automata","display_name":"A Pumping Lemma for Ordered Restarting Automata","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2620566111","doi":"https://doi.org/10.1007/978-3-319-60252-3_18","mag":"2620566111"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-60252-3_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60252-3_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01656996","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002395022","display_name":"Kent Kwee","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Kent Kwee","raw_affiliation_strings":["Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109, Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111446858","display_name":"Friedrich Otto","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friedrich Otto","raw_affiliation_strings":["Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109, Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002395022"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.453,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61881814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9878000020980835,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pumping-lemma-for-regular-languages","display_name":"Pumping lemma for regular languages","score":0.8949475288391113},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8144346475601196},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6314340829849243},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6263344287872314},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.5621828436851501},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.5356212854385376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5337245464324951},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5261563658714294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5040642023086548},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4543130397796631},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.45210808515548706},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4433445930480957},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4086606502532959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3894612789154053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2023329734802246},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.1682058572769165},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16453349590301514},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08023375272750854},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.06626537442207336},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.06587421894073486}],"concepts":[{"id":"https://openalex.org/C157968401","wikidata":"https://www.wikidata.org/wiki/Q2292874","display_name":"Pumping lemma for regular languages","level":5,"score":0.8949475288391113},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8144346475601196},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6314340829849243},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6263344287872314},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.5621828436851501},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.5356212854385376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5337245464324951},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5261563658714294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5040642023086548},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4543130397796631},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.45210808515548706},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4433445930480957},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4086606502532959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3894612789154053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2023329734802246},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.1682058572769165},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16453349590301514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08023375272750854},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.06626537442207336},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.06587421894073486},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"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":2,"locations":[{"id":"doi:10.1007/978-3-319-60252-3_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60252-3_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01656996v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01656996","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.226-237, ⟨10.1007/978-3-319-60252-3_18⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01656996v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01656996","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.226-237, ⟨10.1007/978-3-319-60252-3_18⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W131160620","https://openalex.org/W315032223","https://openalex.org/W421997344","https://openalex.org/W1171547469","https://openalex.org/W1970379778","https://openalex.org/W2018985211","https://openalex.org/W2057834256","https://openalex.org/W2076508310","https://openalex.org/W2138781755","https://openalex.org/W2406421587","https://openalex.org/W2811303545","https://openalex.org/W3014316592","https://openalex.org/W3104597505","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2229354094","https://openalex.org/W236969328","https://openalex.org/W4295836506","https://openalex.org/W2969647416","https://openalex.org/W2037441184","https://openalex.org/W2105739157","https://openalex.org/W2057272273","https://openalex.org/W4312828186","https://openalex.org/W2002565773","https://openalex.org/W1989689428"],"abstract_inverted_index":{"While":[0],"stateless":[1],"ordered":[2,14,83],"restarting":[3,15,84],"automata":[4,16,37,85,136],"accept":[5,19,137],"exactly":[6],"the":[7,30,48,52,57,66,95,120,131,139],"regular":[8,140],"languages,":[9,51,55],"it":[10],"is":[11,38,45,69,87,123],"known":[12],"that":[13,22,44,86,99,119,130],"with":[17,61],"states":[18],"some":[20],"languages":[21,33,43,60,134],"are":[23,138],"not":[24],"even":[25],"growing":[26,58],"context-sensitive.":[27],"In":[28],"fact,":[29],"class":[31],"of":[32,42],"accepted":[34],"by":[35],"these":[36,72,109,127,135],"an":[39],"abstract":[40],"family":[41],"incomparable":[46],"to":[47,63,101],"(deterministic)":[49,53],"linear":[50],"context-free":[54],"and":[56,65,129],"context-sensitive":[59],"respect":[62],"inclusion,":[64],"emptiness":[67],"problem":[68,122],"decidable":[70,125],"for":[71,82,108,126],"automata.":[73,110],"These":[74],"results":[75],"were":[76],"derived":[77],"using":[78],"a":[79,104],"Cut-and-Paste":[80],"Lemma":[81,107],"based":[88],"on":[89,112],"Higman\u2019s":[90],"theorem.":[91],"Here":[92],"we":[93,116],"extend":[94],"arguments":[96],"used":[97],"in":[98],"proof":[100],"actually":[102],"derive":[103],"real":[105],"Pumping":[106,114],"Based":[111],"this":[113],"Lemma,":[115],"then":[117],"prove":[118],"finiteness":[121],"also":[124],"automata,":[128],"only":[132],"unary":[133],"ones.":[141]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}