Let x be a string that belongsto {0, 1}* of length n. there is an fa that accepts
only x. how many states arenecessary for this fa? [5 marks]
[hint: put different values ofn and see how many states are required for a particular
value of n]

Solved
Show answers

Ask an AI advisor a question