Skip to main content
8 events
when toggle format what by license comment
Jul 26, 2020 at 20:19 vote accept Regan Koopmans
Feb 24, 2017 at 1:57 history tweeted twitter.com/StackCompSci/status/834945252884635648
Feb 23, 2017 at 20:56 comment added Hendrik Jan Do you suggest that accepting states are a special case of dead states, i.e., without outgoing edges? Probably you got this impression as accepting states are also called final states in some texts. They are however not final in the sense that computation cannot proceed from there. These states are not the last state of the automaton, but the accepting states are more like flags, that indicate whether a computation is accepting if the last state in the computation happens to end on such a state. During a computation we can happily pass as many final/accepting states as we like.
Feb 23, 2017 at 15:19 answer added Yuval Filmus timeline score: 4
Feb 23, 2017 at 6:25 comment added Regan Koopmans Purely for the fact that including them does not seem to add value to the property. In my (admittedly naive) opinion, total transition functions are most useful in preventing the occurrence of dead states, since these signify errors in the modeling of languages and state machines. Accepting states are of course a special case of this. Otherwise, does making the statement that a transition function is total, only exist as a classification criteria?
Feb 23, 2017 at 6:01 comment added pzp Why should it not apply?
Feb 23, 2017 at 5:46 review First posts
Feb 23, 2017 at 14:14
Feb 23, 2017 at 5:41 history asked Regan Koopmans CC BY-SA 3.0