260 views
0 votes
0 votes

i think answer b 3..and they give 2?

1 Answer

0 votes
0 votes

The language L = (a^2)*

Related questions

0 votes
0 votes
0 answers
1
reena_kandari asked Jan 31, 2017
138 views
Number of states in MFA that accepts all the string of a's and b's where each string contain atmost 5 a's and 6 b's?
0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
477 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
0 votes
0 votes
0 answers
4