Reachability of DFA part

Andy <borucki.andrzej@gmail.com>
Fri, 20 Dec 2019 04:53:26 -0800 (PST)

          From comp.compilers
Related articles
Reachability of DFA part borucki.andrzej@gmail.com (Andy) (2019-12-20)
Re: Reachability of DFA part 493-878-3164@kylheku.com (Kaz Kylheku) (2019-12-20)
Re: Reachability of DFA part borucki.andrzej@gmail.com (Andy) (2019-12-21)
Re: Reachability of DFA part DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2019-12-21)
Reachability of DFA part christopher.f.clark@compiler-resources.com (Christopher F Clark) (2019-12-23)
Re: Reachability of DFA part 493-878-3164@kylheku.com (Kaz Kylheku) (2019-12-24)
| List of all articles for this month |
From: Andy <borucki.andrzej@gmail.com>
Newsgroups: comp.compilers
Date: Fri, 20 Dec 2019 04:53:26 -0800 (PST)
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="51676"; mail-complaints-to="abuse@iecc.com"
Keywords: DFA, question
Posted-Date: 20 Dec 2019 10:54:11 EST

Sometmimes part of DFA can be unreached: ab(a|b)*ba - ba is unreachable.
Solution is check back transitions - must be >0 back transitions from each
state (and >0 transitions from each non-finished state)? Or are better methods
- if can exists cases, if all backtransitions count > 0 and still
unreachable?

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.