Revision as of 16:13, 24 October 2021 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,306 edits →Section "Complete and incomplete" ← Previous edit		Revision as of 11:40, 28 October 2021 edit undo 46.223.160.163 (talk) →Simplified diagram representation: new section Next edit →
Line 144: :{{done}} The old description is ok (if read as "given a state and an input symbol, a transition on them is defined"), but apparently can be misleading; your suggestion is more clear, so I changed the text. - [[User:Jochen Burghardt\|Jochen Burghardt]] ([[User talk:Jochen Burghardt\|talk]]) 16:13, 24 October 2021 (UTC) == Simplified diagram representation == It should be mentioned in this article that several transitions labeled with different input symbols leading from state A to state B can be combined into one transition to display the diagram in a simplified way. Technically, however, they are separate transitions, of course. See at the top of page 3: https://www.cs.toronto.edu/~amir/teaching/csc236f15/materials/lec10.pdf Sicro --- [[Special:Contributions/46.223.160.163\|46.223.160.163]] ([[User talk:46.223.160.163\|talk]]) 11:40, 28 October 2021 (UTC)

Talk:Deterministic finite automaton: Difference between revisions