Content deleted Content added
→Recognizing valid email addresses: Reply: Identifiers in C are probably a nice example. |
→Section "Complete and incomplete": new section |
||
Line 132:
::Identifiers in C are probably a nice example since you have a small alphabet (letters, digits, underscore). Password rules ("at least an upper case, a lower case letter, a digit, and a punctuation char must occur"), while simple to describe textually, would probably already be too big. (I think you need at least 1 + 4 + 6 + 4 + 1 states?) – [[User:Tea2min|Tea2min]] ([[User talk:Tea2min|talk]]) 15:17, 4 November 2020 (UTC)
== Section "Complete and incomplete" ==
> According to the above definition, deterministic finite automata are always complete: they define a transition for each state and each input symbol.
Isn't the description wrong? I understand the sentence to mean that each state must have transitions and the automaton must have transitions for each input symbol, but as far as I know, each state must have transitions for each input symbol.
My suggestion: "they define from each state a transition for each input symbol."
Sicro --- [[Special:Contributions/46.223.160.111|46.223.160.111]] ([[User talk:46.223.160.111|talk]]) 09:19, 24 October 2021 (UTC)
| |||