Revision as of 17:10, 5 September 2020 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,306 edits →Definition of local automaton ← Previous edit		Revision as of 11:16, 4 November 2020 edit undo Tea2min (talk \| contribs) Extended confirmed users, Pending changes reviewers 21,977 edits →Recognizing valid email addresses: new section Next edit →
Line 124: :{{done}} I believe you are right. Although every DFA can be made complete by adding an "error" state, completing a local DFA will destroy locality. Also, your proof looks convincing. - [[User:Jochen Burghardt\|Jochen Burghardt]] ([[User talk:Jochen Burghardt\|talk]]) 17:10, 5 September 2020 (UTC) == Recognizing valid email addresses == The lead section mentions recognizing syntactilly valid [[email address]]es as an application for deterministic finite automata. I am not sure if this is supposed to be an in-joke: the syntax and grammar of email addresses at least as defined by the original [[RFC 822]] is quite complex, and using DFAs (at least in the form of regular expressions) is kind of seen as an anti-pattern, at least as far as I understand it. See e.g. [[Talk:Email address#Complexity of email addresses]]. – [[User:Tea2min\|Tea2min]] ([[User talk:Tea2min\|talk]]) 11:16, 4 November 2020 (UTC)

Talk:Deterministic finite automaton: Difference between revisions