in Theory of Computation
224 views
0 votes
0 votes

in Theory of Computation
224 views

1 Answer

0 votes
0 votes
THE L(X)=SET OF ALL STRINGS ENDING WITH 1

HENCE 2 STATES IN ITS MINIMAL DFA