Talk:Deterministic finite automaton: Difference between revisions

Content deleted Content added
Classifiers: new section
Line 108:
 
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)
 
== Classifiers ==
 
The description of classifiers claims that a classifier has "has more than two terminal states", which seems to imply that a DFA cannot have more than two terminal states. Should this be "more than two ''classes'' of terminal states"? A DFA can obviously have three terminal states, but just two classes (accept and reject). This is not clear from the current wording on classifiers.