Next Article in Journal
An On-Line Tracker for a Stochastic Chaotic System Using Observer/Kalman Filter Identification Combined with Digital Redesign Method
Previous Article in Journal
An Architectural Based Framework for the Distributed Collection, Analysis and Query from Inhomogeneous Time Series Data Sets and Wearables for Biofeedback Applications
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(1), 24; doi:10.3390/a10010024

Problems on Finite Automata and the Exponential Time Hypothesis

1
FB 4, Informatikwissenschaften, University of Trier, Universitätsring, 54286 Trier, Germany
2
Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076 Tübingen, Germany
*
Author to whom correspondence should be addressed.
Academic Editor: Florin Manea
Received: 20 September 2016 / Revised: 23 January 2017 / Accepted: 25 January 2017 / Published: 5 February 2017
View Full-Text   |   Download PDF [349 KB, uploaded 5 February 2017]   |  

Abstract

We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection. All these problems are known to be CoNP-hard for nondeterministic finite automata, even when restricted to unary input alphabets. A different type of problems on finite automata relates to aperiodicity and to synchronizing words. We also consider finite automata that work on commutative alphabets and those working on two-dimensional words. View Full-Text
Keywords: finite automata; Exponential Time Hypothesis; universality problem; equivalence problem; emptiness of intersection finite automata; Exponential Time Hypothesis; universality problem; equivalence problem; emptiness of intersection
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Fernau, H.; Krebs, A. Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms 2017, 10, 24.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top