Revision as of 22:02, 27 January 2014 edit Loadmaster (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 13,248 edits m →DFA cannot recognize anbn?: ce ← Previous edit		Revision as of 18:43, 31 January 2015 edit undo Chip Wildon Forster (talk \| contribs) 39 edits Described reason for removal of large section. Next edit →
Line 102: ::I thought so, but the wording was not clear, so I changed it (adding "arbitrary" to indicate an unbounded ''n''). — [[User:Loadmaster\|Loadmaster]] ([[User talk:Loadmaster\|talk]]) 22:01, 27 January 2014 (UTC) == Removed "Accept and Generate Modes" section == I've removed the "Accept and Generate Modes" section on that grounds that it's original research by a defunct user. A search through my textbooks, university library search engine and Google didn't reveal anyone else who's talking about generate modes for DFAs. Even if that section isn't original research, we should consider whether it lends undue weight to a rarely-discussed type of DFA. [[User:Chip Wildon Forster\|Chip Wildon Forster]] ([[User talk:Chip Wildon Forster\|talk]]) 18:42, 31 January 2015 (UTC)

Talk:Deterministic finite automaton: Difference between revisions