On Basic Properties of Jumping Finite Automata

DOI10.1142/S0129054118500016zbMath1387.68162arXiv1511.08396MaRDI QIDQ4639928

Vojtěch Vorel

Publication date: 14 May 2018

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

Full work available at URL: https://arxiv.org/abs/1511.08396

zbMATH Keywords

insertion-deletion systemsjumping finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ Jumping automata over Infinite words ⋮ Properties of right one-way jumping finite automata ⋮ On double-jumping finite automata and their closure properties ⋮ Two Results on Discontinuous Input Processing ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ Watson–Crick Jumping Finite Automata ⋮ Nondeterministic right one-way jumping finite automata

Cites Work

• Recent developments on insertion-deletion systems
• On regularity of context-free languages
• Insertion languages
• Insertion and deletion closure of languages
• Characterization and complexity results on jumping finite automata
• Two Results on Discontinuous Input Processing
• JUMPING FINITE AUTOMATA
• Regulated Grammars and Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Basic Properties of Jumping Finite Automata