On double-jumping finite automata and their closure properties

DOI10.1051/ita/2018013zbMath1423.68258OpenAlexW2910843179WikidataQ128558278 ScholiaQ128558278MaRDI QIDQ5223615

Radim Kocman, Zbyněk Křivka, Alexander Meduna

Publication date: 18 July 2019

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2018013

zbMATH Keywords

discontinuous and parallel tape readingeven-length languagesgeneral jumping finite automataleft and right jumps

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model

Cites Work

• Unnamed Item
• Characterization and complexity results on jumping finite automata
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• Two Results on Discontinuous Input Processing
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• Jumping Grammars
• Jumping Scattered Context Grammars
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA
• On 5′→3′ Sensing Watson-Crick Finite Automata
• One-Way Jumping Finite Automata

This page was built for publication: On double-jumping finite automata and their closure properties