Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'503'724
Articles rated: 2609

23 April 2024

» arxiv » 1512.0482

Article overview

Characterization and Complexity Results on Jumping Finite Automata
Henning Fernau ; Meenakshi Paramasivan ; Markus L. Schmid ; Vojtěch Vorel ;
Date:	1 Dec 2015
Abstract:	In a jumping finite automaton, the input head can jump to an arbitrary position within the remaining input after reading and consuming a symbol. We characterize the corresponding class of languages in terms of special shuffle expressions and survey other equivalent notions from the existing literature. Moreover, we present several results concerning computational hardness and algorithms for parsing and other basic tasks concerning jumping finite automata.
Source:	arXiv, 1512.0482
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap