Talk:Deterministic finite automaton: Difference between revisions

Content deleted Content added
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WPCS}}, {{Maths rating}}. Remove 3 deprecated parameters: field, historical, vital.
 
(5 intermediate revisions by 4 users not shown)
Line 1:
{{WikiProject banner shell|class=Start|
{{WPCS|importance=high|class=start}}
{{WikiProject Computer science|importance=high}}
{{maths rating
{{WikiProject Mathematics|importance=mid}}
|field=algebra
|importance=mid
|class=Start
|vital=
|historical=
}}
==Technical flag==
Line 92 ⟶ 88:
* '''Support''' per nom. —''[[User:Ruud Koot|Ruud]]'' 20:37, 25 November 2011 (UTC)
 
:''The above discussion is preserved as an archive of a [[WP:RM|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on this talk page. No further edits should be made to this section.''</div><!-- Template:RM bottom -->
 
== DFA cannot recognize ''a<sup>n</sup>b<sup>n</sup>''? ==
Line 137 ⟶ 133:
> 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 transitionsa transition and the automaton must have transitionsa transition for each input symbol, but as far as I know, each state must have transitionsa transition 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)
 
:{{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)
 
:I agree that this should be explained somewhere. Unfortunately, diagram notation isn't explained at all in this article. Instead it links to [[State diagram]] which handles the huge amount of existing variants; thus is is not that easy to find the right place to insert your information. - [[User:Jochen Burghardt|Jochen Burghardt]] ([[User talk:Jochen Burghardt|talk]]) 12:29, 28 October 2021 (UTC)