Operational state complexity and decidability of jumping finite automata

DOI10.1007/978-3-319-62809-7_6zbMath1410.68195OpenAlexW2738441772MaRDI QIDQ2408795

Martin Kutrib, Markus Holzer, Simon Beier

Publication date: 13 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62809-7_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ The effect of jumping modes on various automata models ⋮ Unnamed Item ⋮ Properties of right one-way jumping finite automata ⋮ Enhancement of automata with jumping modes ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ Nondeterministic right one-way jumping finite automata

This page was built for publication: Operational state complexity and decidability of jumping finite automata