Abstract
We obtain a sharp upper bound for the nondeterministic state complexity of the application of a finite transducer to a regular language.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have