Problems on Finite Automata and the Exponential Time Hypothesis
AbstractWe 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
Scifeed alert for new publicationsNever 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
Fernau, H.; Krebs, A. Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms 2017, 10, 24.
Fernau H, Krebs A. Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms. 2017; 10(1):24.Chicago/Turabian Style
Fernau, Henning; Krebs, Andreas. 2017. "Problems on Finite Automata and the Exponential Time Hypothesis." Algorithms 10, no. 1: 24.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.