Skip to Main content Skip to Navigation
Conference papers

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)

Abstract : Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or $$\lambda $$-transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, November 29, 2019 - 4:36:14 PM
Last modification on : Friday, November 29, 2019 - 5:01:48 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Simon Beier, Markus Holzer. Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.74-85, ⟨10.1007/978-3-030-23247-4_5⟩. ⟨hal-02387300⟩



Record views