Share
Explore BrainMass

Finite automata

Assuming Σ = { a,b }, build an FA that accepts only those words that
do not end with ba.

$2.19