Forums before death by AOL, social media and spammers... "We can't have nice things"
| comp.compilers | Compiler construction, theory, etc. (Mod | 2,753 messages |
[ << oldest | < older | list | newer > | newest >> ]
| Message 2,526 of 2,753 |
| Andy to All |
| Reachability of DFA part |
| 20 Dec 19 04:53:26 |
From: borucki.andrzej@gmail.com 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? --- SoupGate-Win32 v1.05 * Origin: you cannot sedate... all the things you hate (1:229/2) |
(c) 1994, bbs@darkrealms.ca