Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

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

Simon Beier
  • Function : Author
  • PersonId : 1038041
Markus Holzer
  • Function : Author
  • PersonId : 1011786

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.
Fichier principal
Vignette du fichier
480958_1_En_5_Chapter.pdf (338.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387300 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

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⟩
39 View
27 Download

Altmetric

Share

Gmail Facebook X LinkedIn More