Abstract
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be efficiently approxima...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have