Question: L 1 = {x {a,b}* | aa is not a substring of x}; L 2 = {x {a, b}* | x ends with ab}. For
L1 = {x
{a,b}* | aa is not a substring of x}; L2 = {x
{a, b}* | x ends with ab}. For the FA that accepts L1
L2 , prove that there cannot be any other FA with fewer states accepting the same language.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
