On the hardness of approximating the minimum consistent acyclic DFA and decision diagram

Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We show that the problems to find the smallest acyclic DFA and OBDD with a fixed order of variables that are consistent with given sets of positive and negative examples are not approximable in polynomial time within worst case factors n1/28 and n1/21, respectively, with the input size n unless P = NP.

Original languageEnglish
Pages (from-to)165-170
Number of pages6
JournalInformation Processing Letters
Volume66
Issue number4
DOIs
Publication statusPublished - 1998 May 29
Externally publishedYes

Keywords

  • Approximation
  • Combinatorial problems
  • Computational complexity
  • Data structures
  • Finite state machine minimization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'On the hardness of approximating the minimum consistent acyclic DFA and decision diagram'. Together they form a unique fingerprint.

  • Cite this