353 views
0 votes
0 votes

L={ap | P is even} , Σ={a} where p>=2.

Number of states in MFA that accepts L* is -----------

1 Answer

Related questions

0 votes
0 votes
0 answers
1
amitqy asked Nov 21, 2018
457 views
What is partial language?
3 votes
3 votes
1 answer
2
4 votes
4 votes
2 answers
3
Kai asked Jan 29, 2017
721 views
When a Multi-tape TM of time complexity T(N) is reduced to a single tape turing machine, the complexity can go upto?
0 votes
0 votes
0 answers
4
Vaishali Trivedi asked Oct 13, 2016
709 views
is this explaination is correct because according me complement given in language is only subset of complement of L . please correct me if i am wrong