Revision as of 22:12, 4 September 2020 edit 2600:1700:6ec0:35c0:d5f2:3a1:b655:c5f7 (talk) →Definition of local automaton: new section ← Previous edit		Revision as of 22:26, 4 September 2020 edit undo 2600:1700:6ec0:35c0:d5f2:3a1:b655:c5f7 (talk) →Missing paths - still deterministic? Next edit →
Line 59: ::I just added a new section to mention the difference. [[User:Rp\|Rp]] ([[User talk:Rp\|talk]]) 09:47, 11 November 2015 (UTC) ::It should be made clear that if a path is missing, the automaton halts ''and rejects the string''. [[Special:Contributions/2600:1700:6EC0:35C0:D5F2:3A1:B655:C5F7\|2600:1700:6EC0:35C0:D5F2:3A1:B655:C5F7]] ([[User talk:2600:1700:6EC0:35C0:D5F2:3A1:B655:C5F7\|talk]]) 22:26, 4 September 2020 (UTC) == Possible error in example ==

Talk:Deterministic finite automaton: Difference between revisions