Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

5
  • $\begingroup$ Why is that so ? If the non-determinism is the problem does it imply that it won't work for NFA either ? $\endgroup$ Commented Jul 22, 2013 at 15:36
  • 3
    $\begingroup$ @Robert777: It won't work for NFA either, unless you determinize it first. For example, consider an automaton over unary alphabet, states A,B,C,D, transitions A -> B, B -> C, C -> C, A -> D, D -> D, initial state A, accepting states C,D. This automaton accepts all nonempty words. If you make C,D sinks the resulting language will be $\{a,aa\}$ instead of $\{a\}$. $\endgroup$ Commented Jul 22, 2013 at 15:43
  • 2
    $\begingroup$ The way I understand "sink" (all outgoing edges loop back) this won't work at all. $\endgroup$ Commented Jul 22, 2013 at 16:34
  • 1
    $\begingroup$ I assumed that as a mental shortcut by "sink" OP meant removing all outgoing edges (or pointing them to a sink in your sense). $\endgroup$ Commented Jul 22, 2013 at 17:13
  • $\begingroup$ @Raphael I really did mean removing all outgoing edges, sorry if I wasn't clear about it. $\endgroup$ Commented Jul 22, 2013 at 18:18