592 views
0 votes
0 votes

1 Answer

Related questions

0 votes
0 votes
1 answer
1
Crackca asked Sep 13, 2021
320 views
If L1 = {a^nb^nc^md^m | n,m>=0}L2 = {a^nb^n | n>=0}L3 = {c^md^m | m>=0}Then L1 – L2.L3(concatenation) is?RegularCSLCFLREL(recursive enumerable)
1 votes
1 votes
3 answers
2
rasto mapp asked Sep 2, 2017
370 views
Regular expression always generates a language.Is it true?Why?
3 votes
3 votes
1 answer
3
Deepthi_ts asked Apr 17, 2017
4,119 views
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:ANFA – 3, DFA – 4BNFA – 3, DFA – 3...
1 votes
1 votes
2 answers
4
Deepthi_ts asked Apr 17, 2017
2,976 views
Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). ThenAOn every input on which M1 doesn’t halt, M2 doesn’t halt too.BOn every i/p on which M1 halts, M2 halts ...