Two Results on Discontinuous Input Processing

DOI10.1007/978-3-319-41114-9_16zbMATH Open1476.68140arXiv1511.08642OpenAlexW2275546263MaRDI QIDQ2829983FDOQ2829983

Vojtěch Vorel

Publication date: 9 November 2016

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

Abstract: First, we show that universality and other properties of general jumping finite automata are undecidable, which answers a question asked by Meduna and Zemek in 2012. Second, we close the study raised by v{C}erno and Mr'{a}z in 2010 by proving that clearing restarting automata using contexts of size two can accept binary non-context-free languages.

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Insertion languages
• Title not available (Why is that?)
• On regularity of context-free languages
• Insertion and deletion closure of languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization and complexity results on jumping finite automata
• JUMPING FINITE AUTOMATA
• Jumping Finite Automata: Characterizations and Complexity
• On Basic Properties of Jumping Finite Automata
• Clearing Restarting Automata

Cited In (3)

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

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

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