Skip to Main content Skip to Navigation
Conference papers

A Pumping Lemma for Ordered Restarting Automata

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01656996
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:43:31 AM
Last modification on : Wednesday, December 6, 2017 - 1:46:24 PM

File

440206_1_En_18_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

131

Files downloads

79