Two Results on Discontinuous Input Processing

DOI10.1007/978-3-319-41114-9_16zbMath1476.68140arXiv1511.08642OpenAlexW2275546263MaRDI QIDQ2829983

Vojtěch Vorel

Publication date: 9 November 2016

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On Basic Properties of Jumping Finite Automata ⋮ On double-jumping finite automata and their closure properties ⋮ Characterization and complexity results on jumping finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of context-free languages
• Insertion languages
• Insertion and deletion closure of languages
• Characterization and complexity results on jumping finite automata
• Jumping Finite Automata: Characterizations and Complexity
• Clearing Restarting Automata
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA

This page was built for publication: Two Results on Discontinuous Input Processing