Decidability of Right One-Way Jumping Finite Automata

DOI10.1142/S0129054120410063zbMath1458.68087OpenAlexW3094532315MaRDI QIDQ5859648

Simon Beier, Markus Holzer

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120410063

zbMATH Keywords

decision problemsjumping finite automataright one-way jumping automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Unnamed Item ⋮ Sweep complexity revisited

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• The method of forced enumeration for nondeterministic automata
• Characterization and complexity results on jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Semigroups, Presburger formulas, and languages
• Jumping Finite Automata: Characterizations and Complexity
• Nondeterministic Space is Closed under Complementation
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA
• Complexity of Problems of Commutative Grammars
• Regulated Grammars and Automata
• Bounded Algol-Like Languages
• Bounded Regular Sets
• On Context-Free Languages
• Grundlagen der Mathematik I
• One-Way Jumping Finite Automata
• Properties of right one-way jumping finite automata

This page was built for publication: Decidability of Right One-Way Jumping Finite Automata