Revision as of 10:18, 16 August 2011 edit Raghunandan ma (talk \| contribs) 8 edits →Possible error in example: new section ← Previous edit		Revision as of 13:34, 16 August 2011 edit undo Ashutosh y0078 (talk \| contribs) 2,179 edits →Possible error in example Next edit →
Line 61: In the section "Advantages and Disadvantages", the example discribes the "bracket" language - i.e. properly paired brackets. This is not formally ''a<sup>n</sup>b<sup>n</sup>'', as stated, but "Strings whose each prefix has more or equal a's than b's" [[User:Raghunandan ma\|Raghunandan ma]] ([[User talk:Raghunandan ma\|talk]]) 10:18, 16 August 2011 (UTC) You are correct. It is bad language. Let me try a fix. ([[User:Ashutosh y0078\|Ashutosh Gupta]] ([[User talk:Ashutosh y0078\|talk]]) 13:34, 16 August 2011 (UTC))

Talk:Deterministic finite automaton: Difference between revisions