DFA Examples 2
DFA Examples 2
Design of a DFA
Construct a DFA that accepts all strings from the language
Solution:
Construct a DFA that accepts all strings from the language
Solution:
Solution:
Construct a DFA which accepts set of all strings over Σ={a,b} of length 2
Solution:
L = {aa, ab, ba, bb}
Design a DFA that accepts the unary number divisible by 3
Construct a DFA which accepts set of all strings over Σ={a,b} of length ≥2
Solution:
Design a DFA such that:
Solution: