Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
Kehinde Adeogun, Christos A. Kapoutsis
Abstract
A recent result by the present authors established a quadratic lower bound, in the worst case, for the increase in the number of states when a one-way nondeterministic finite automaton is converted to a two-way deterministic finite automaton. Although this simply matched a well-known pre-existing quadratic lower bound by Chrobak, it used a distinct proof method. We show that, much like Chrobak's, this new method is also unable to deliver any lower bound strictly greater than quadratic.
Create a lesson
Related papers
Context-Free Fixed Points and Complete Classification of Orbits in Picard Iteration for Guarded Power Language Operators
Atanas Ilchev, Hristo Kiskinov, George Pashev et al.
Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
Ziran Wang, Jie An, Naijun Zhan
Compressed Subsequence Checking is PSPACE-complete
Markus Lohrey
Non-Terminal Complexity of Simple Semi-Conditional Grammars
Henning Fernau, Sanjay Jain, Linus Richter et al.
On the Kanazawa--Salvati Conjecture
Takao Yuyama
Stochastic Hybrid Automata for Power Profile Modeling in Energy Systems
Lisa Willemsen, Anne Remke, Johann L. Hurink