A Pumping Lemma for Ordered Restarting Automata - Descriptional Complexity of Formal Systems (DCFS 2017) Access content directly
Conference Papers Year : 2017

A Pumping Lemma for Ordered Restarting Automata

Kent Kwee
  • Function : Author
  • PersonId : 1024578
Friedrich Otto
  • Function : Author
  • PersonId : 1024579


While stateless ordered restarting automata accept exactly the regular languages, it is known that ordered restarting automata with states accept some languages that are not even growing context-sensitive. In fact, the class of languages accepted by these automata is an abstract family of languages that is incomparable to the (deterministic) linear languages, the (deterministic) context-free languages, and the growing context-sensitive languages with respect to inclusion, and the emptiness problem is decidable for these automata. These results were derived using a Cut-and-Paste Lemma for ordered restarting automata that is based on Higman’s theorem. Here we extend the arguments used in that proof to actually derive a real Pumping Lemma for these automata. Based on this Pumping Lemma, we then prove that the finiteness problem is also decidable for these automata, and that the only unary languages these automata accept are the regular ones.
Fichier principal
Vignette du fichier
440206_1_En_18_Chapter.pdf (362.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01656996 , version 1 (06-12-2017)





Kent Kwee, Friedrich Otto. A Pumping Lemma for Ordered Restarting Automata. 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⟩. ⟨hal-01656996⟩
68 View
71 Download



Gmail Facebook X LinkedIn More