Operational state complexity and decidability of jumping finite automata

DOI10.1007/978-3-319-62809-7_6MaRDI QIDQ2408795zbMATH OpenOpenAlexFDO

Authors Simon Beier, Markus Holzer, Martin Kutrib

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)

Recommendations

• Operational state complexity and decidability of jumping finite automata
• On basic properties of jumping finite automata
• Characterization and complexity results on jumping finite automata
• Jumping finite automata: characterizations and complexity
• On double-jumping finite automata and their closure properties

Cited in

(13)

• On basic properties of jumping finite automata
• Nondeterministic right one-way jumping finite automata
• The effect of jumping modes on various automata models
• New results on semilinear sets and variants of jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Jump complexity of finite automata with translucent letters
• On the descriptional complexity of operations on semilinear sets
• Decidability of right one-way jumping finite automata
• Enhancement of automata with jumping modes
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• Characterization and complexity results on jumping finite automata
• Jumping Automata for Uniform Strategies
• Properties of right one-way jumping finite automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408795)