Note on the Lower Bounds of Bimachines
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 (2n) states.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.