Automata Theory - Solution
Automata Theory - Solution
Solution:
𝐿2 = {𝑊|𝑊 accepts all binary strings where the last symbol is 0 or that contains only 1𝑠 }
Solution:
Page 1 of 3
DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF ENGINEERING & TECHNOLOGY, PESHAWAR
Solution:
𝜹 0 1 𝜹 0 1
→ 𝑞0 𝑞0 {𝑞0 , 𝑞1 } → 𝑞0 𝑞0 {𝑞0 , 𝑞1 }
∗ 𝑞2 − − ∗ {𝑞0 , 𝑞2 } 𝑞0 {𝑞0 , 𝑞1 }
Write the regular expression for the language 𝐿4 over the alphabet {𝑎, 𝑏} consisting of all strings that start
with 'a' and end with 'b', with any combination of 'a's and 'b's in between.
Solution:
a. 𝒂(𝒂 + 𝒃)∗ 𝒃
Page 3 of 3