Register

MADE EASY test series

379 views

2 Answers

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

542
views
1 answers
0 votes
Souvik33 asked Dec 27, 2022
542 views
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse
User Avatar
426
views
1 answers
0 votes
abhinowKatore asked Mar 7, 2022
426 views
MADE EASY 2022 Work book -Theory of Computation series
Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equivalence classes isalways Fill up the blanks
User Avatar
2.1k
views
2 answers
3 votes
twin_123 asked Nov 18, 2018
2,146 views
Number of DFA's (Made easy test series)
The number of DFA's with four states which can be constructed of the alphabet $\Sigma = \{ a,b \}$ with a designated initial state are $2^n$, then the ... IN DFA IT IS COMPULSORY TO HAVE 1 FINAL STATE. 4c0 should not be taken,correct me?
User Avatar
310
views
1 answers
0 votes
Luci3671 asked Nov 11, 2022
310 views
Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
User Avatar
Link Copied!