Nondeterministic right one-way jumping finite automata

• Published in: Information and computation Vol. 284; p. 104687
• Main Authors: Beier, Simon, Holzer, Markus
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.03.2022
• ISSN: 0890-5401
• DOI: 10.1016/j.ic.2021.104687

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 λ-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.