Note on the Lower Bounds of Bimachines
Formal Languages and Automata Theory
2018-04-27 v1
Abstract
This is a brief note on the lower bound of bimachines. Particularly, we report that there is a class of functional transducers with states that do not admit a bimachine with fewer than states.
Cite
@article{arxiv.1804.10146,
title = {Note on the Lower Bounds of Bimachines},
author = {Stefan Gerdjikov},
journal= {arXiv preprint arXiv:1804.10146},
year = {2018}
}