Minimum consistent DFA problem cannot be approximated within any polynomial

Volumn , Issue , 1989, Pages 421-432

  Pitt, Leonard ^a   Warmuth, Manfred K ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; SYSTEMS SCIENCE AND CYBERNETICS--LEARNING SYSTEMS;

DETERMINISTIC FINITE AUTOMATA; LEARNING AUTOMATA; MINIMUM CONSISTENT DFA PROBLEM;

AUTOMATA THEORY;

EID: 0024868429     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73007.73048     Document Type: Conference Paper

References (20)