Talk:Determinization of Automaton

There are many kinds of Automaton. NFA is one kind of automaton. Powerset Construction is procedure for NFA. So, this article is not redundant. Rather it needs expansion. Ashutosh Gupta 23:19, 28 March 2011 (UTC)
 * Do you have examples of automata determinization which are not the powerset construction, or a variant thereof? --a3_nm (talk) 23:44, 17 October 2011 (UTC)
 * There are many examples... Take Buchi automaton its determination is very complicated. McNaughton's_Theorem provides one algorithm for it. — Preceding unsigned comment added by Ashutosh y0078 (talk • contribs)


 * I've redirected to Powerset construction since determinization redirects there as well (that would have been the proper title of this article), and because this article contained mainly unsourced and incorrect assertions of importance. Yes, determinizing an NFA (or other automaton type) can be useful, but it's not usually done in practice. Most regex matchers for example work with NFAs, because matching with NFAs can be done in linear time and constructing NFAs can also be done in linear time, while determinizing them can take exponential time and space. Q VVERTYVS (hm?) 18:29, 25 May 2014 (UTC)