0 votes 0 votes I have a naive doubt about the below statement L. ϕ = ϕ. L = ϕ I want to know if the above statement holds true. If yes, can you please explain ? Theory of Computation theory-of-computation regular-language finite-automata + – jiminpark asked Dec 29, 2021 jiminpark 342 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments jiminpark commented Dec 29, 2021 reply Follow Share @raja11sep Sir, I have gone through those links already. I had commented their but the moderator deleted my comment because questions can’t be asked in the answer section/ comment he said ! But my question is “ Is the above diagram correct “ ? If wrong why? 0 votes 0 votes palashbehra5 commented Dec 30, 2021 reply Follow Share Transitions while concatenating 2 dfas are supposed to happen from final states to start states. In case one, your diagram is correct, and as the dead DFA has no accepting state, the language accepted is eventually NULL. However, in your second case, there shouldn't be any transition possible at all, because there are no final states to transit from to the start of L. 0 votes 0 votes jiminpark commented Dec 30, 2021 reply Follow Share @palashbehra5 Thank you I didn’t know about this one :) Transitions while concatenating 2 dfas are supposed to happen from final states to start states. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes ∅ in concatenation is similar to 0 in multiplication. x.0 = 0 doesn’t mean x is 0. Similarly L . ∅ = ∅ doesn’t mean L = ∅. AngshukN answered Dec 29, 2021 AngshukN comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Dec 29, 2021 reply Follow Share This is not a proof. 1 votes 1 votes Please log in or register to add a comment.