Explore BrainMass
Share

Finite automata

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

© BrainMass Inc. brainmass.com August 14, 2018, 9:19 am ad1c9bdddf
$2.19