Revision as of 11:31, 17 August 2011 edit Ashutosh y0078 (talk \| contribs) 2,179 edits →Possible error in example ← Previous edit		Revision as of 06:53, 18 August 2011 edit undo Raghunandan ma (talk \| contribs) 8 edits →Possible error in example Next edit →
Line 69: Your suggestion is good. Please add it yourself. I also suggest to cite [[powerset construction]] page for the algorithm that translates NFA into DFA. ([[User:Ashutosh y0078\|Ashutosh Gupta]] ([[User talk:Ashutosh y0078\|talk]]) 11:30, 17 August 2011 (UTC)) Have added this. Also made some small changes in the wording for union/intersection/complement at the beginning of this section. [[User:Raghunandan ma\|Raghunandan ma]] ([[User talk:Raghunandan ma\|talk]]) 06:53, 18 August 2011 (UTC)

Talk:Deterministic finite automaton: Difference between revisions