Theory Of Computing (Csc520)
L₁ = {w : w = a*b*} and L₂ = {w : w = aⁿbⁿ}. L₁ ∈ RLs, and L₂ ∉ RLs. |RLs| = ℵ₀
See the attachment :There is two problem [1A and 1B]
CSC 520 Spring 2020 HW #1a
1.a.i (10 points) Complete the diagram of MD to show a DFSM converted from MND. Include a dead state if needed. Remember that ℇ-transitions, and multiple transitions on the same input symbol, are not allowed in a DFSM; and that the states in a converted DFSM are labeled with the set of states the NDFSM could be in after reading the same input. Your diagram must be easy to interpret or it will not be graded.
NDFSM MND
MD — complete the diagram of a DFSM converted from MND
CSC 520 Spring 2020 HW #1a Page 1
1.a.ii (2 points) Derive a characteristic function for the language accepted by both MD and MND.
CSC 520 Spring 2020 HW #1a Page 2
1.ii
CSC 520 Spring 2020 HW #1a Page 3