Timeline for What is the algorithm for a decider to get the language accepted by a DFA?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2018 at 21:11 | comment | added | mover333 | @David Richerby Yes while I do not believe my text book mentions cross product DFAs, it did show how to prove RLs are closed under union / intersection / complement using DFAs. I think my major confusing came from both the book's (and my professor's) focus on determining $L(A)$ without mentioning that in the end you don't even need to determine $L(C)$ you can simply construct a DFA that recognizes $L(C)$. | |
| Oct 31, 2018 at 10:00 | comment | added | David Richerby | @mover96 Your textbook surely gives this exact construction for union and/or intersection and all you have to do to get this one is to modify the accepting set in the appropriate way. Also, your textbook probably shows how to construct an automaton that decides $\overline{C}$ from one that decides $C$, and then you can use $A\setminus B = A\cap\overline{B}$. One of the key differences between study at university and at school is that you're expected to be able to figure out things that are very similar to things that you have been told, without having them spelled out explicitly. | |
| Oct 31, 2018 at 7:07 | comment | added | mover333 | This is exactly what I was looking for. Thank you! I really wish my text book covered this, everything else has been so detailed. | |
| Oct 31, 2018 at 7:06 | vote | accept | mover333 | ||
| Oct 31, 2018 at 3:56 | history | answered | Yuval Filmus | CC BY-SA 4.0 |