Note on the Lower Bounds of Bimachines
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BUTCSF5Yrecord.jsonopen to challenge →
classification
cs.FL
keywords
bimachineslowernotestatesadmitbimachineboundbounds
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.