publication . Other literature type . Article . 1978

On the complexity of minimum inference of regular sets

Dana Angluin;
Open Access
  • Published: 01 Dec 1978
  • Publisher: Elsevier BV
Abstract
We prove results concerning the computational tractability of some problems related to determining minimum realizations of finite samples of regular sets by finite automata and regular expressions.
Subjects
free text keywords: Engineering(all), Finite-state machine, Discrete mathematics, Inference, Regular sets, Nondeterministic finite automaton, Regular expression, Quantum finite automata, Mathematics
Related Organizations
Any information missing or wrong?Report an Issue