NFA minimization
id:
nfa-minimization-288-7200428
title:
NFA minimization
text:
In automata theory, NFA minimization is the task of transforming a given nondeterministic finite automaton (NFA) into an equivalent NFA that has a minimum number of states, transitions, or both. While efficient algorithms exist for DFA minimization, NFA minimization is PSPACE-complete. No efficient algorithms are known, and under the standard assumption P ≠ PSPACE, none exist. The most efficient known algorithm is the Kameda‒Weiner algorithm.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/NFA_minimization
date created:
date modified:
2021-04-24T14:57:21Z
main entity:
{"identifier":"Q97358379","url":"https://www.wikidata.org/entity/Q97358379"}
image:
fields total:
13
integrity:
13