Question
Let Σ = {a,b} and
let R = (a*)+(b*) be a regular expression. Prove that there cannot exist any deterministic ﬁnite state machine M = (Q,Σ,δ,q_{0},A) such that |Q| = 3∧L(M) = L(R).
Question
Let Σ = {a,b} and
let R = (a*)+(b*) be a regular expression. Prove that there cannot exist any deterministic ﬁnite state machine M = (Q,Σ,δ,q_{0},A) such that |Q| = 3∧L(M) = L(R).
Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.
Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!