Question: List the 56 strings that will suffice to test whether a three state FA over = {a b} has a finite language.
List the 56 strings that will suffice to test whether a three state FA over Σ = {a b} has a finite language.
Step by Step Solution
3.36 Rating (168 Votes )
There are 3 Steps involved in it
a a a a aa a ab ab ab a ab b b ba b aa bab b b b ba b bb a ... View full answer
Get step-by-step solutions from verified subject matter experts
