hello prof, i have a question about the exam. When you ask to find, given a language, a dfa directly without further requests in the assignment, when maybe we are not able to find the dfa directly, could we in any case find the equivalent nfa and then convert it into the dfa using the algorithm you showed us in class? clearly describing all the steps to get to what the assignment asks. I await your feedback and thank you!!!
costruct a dfa directly using the subset construction in the exam
by PIERSILVIO SPICOLI -
Number of replies: 2
In reply to PIERSILVIO SPICOLI
Re: costruct a dfa directly using the subset construction in the exam
by Giorgio Satta -
The answer is yes, if there are no further specifications.
In reply to Giorgio Satta
Re: costruct a dfa directly using the subset construction in the exam
by PIERSILVIO SPICOLI -
thank you professore