Note on the Lower Bounds of Bimachines

14 Apr 2018 Gerdjikov Stefan

This is a brief note on the lower bound of bimachines. Particularly, we report that there is a class of functional transducers with $O(n)$ states that do not admit a bimachine with fewer than $\Theta(2^n)$ states...

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY