umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The tractability frontier for NFA minimization
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Formella och naturliga språk)
2012 (English)In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 78, no 1, 198-210 p.Article in journal (Refereed) Published
Abstract [en]

We prove that minimizing finite automata is NP-hard for almost all classes of automata that extend the class of deterministic finite automata. More specifically, we show that minimization is NP-hard for all finite automata classes that subsume the class of δNFAs which accept strings of length at most three. Here, δNFAs are the finite automata that are unambiguous, allow at most one state q with a non-deterministic transition for at most one alphabet symbol a, and are allowed to visit state q at most once in a run. As a corollary, we also obtain that the same result holds for all finite automata classes that subsume that class of finite automata that are unambiguous, have at most two initial states, and accept strings of length at most two.

Place, publisher, year, edition, pages
Elsevier , 2012. Vol. 78, no 1, 198-210 p.
Keyword [en]
Finite automata, Optimization, State minimization, Complexity
National Category
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-48008DOI: 10.1016/j.jcss.2011.03.001OAI: oai:DiVA.org:umu-48008DiVA: diva2:446104
Available from: 2011-10-06 Created: 2011-10-06 Last updated: 2017-12-08

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Björklund, Henrik

Search in DiVA

By author/editor
Björklund, Henrik
By organisation
Department of Computing Science
In the same journal
Journal of computer and system sciences (Print)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 80 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf