Register

Recent questions tagged myhill-nerode

0 votes
1 answer
2
MadeEasy Test Series: Theory Of Computation - Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
User Avatar
1 votes
1 answer
3
Equivalence classes
Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.
Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.
User Avatar
5 votes
1 answer
4
Myhill Nerode Theorem
Can Someone explain what is Myhill Nerode Theorem and different Languages CLasses is ? ( please explain in detail ) Solution involving this as an exaple is prefered L={ank∣k>0,andn is a positive integer constant}
Can Someone explain what is Myhill Nerode Theorem and different Languages CLasses is ? ( please explain in detail )Solution involving this as an exaple is prefered L={an...
User Avatar
7 votes
2 answers
5
TOC -Number of Equivalence Classes
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivalence classes here...
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
User Avatar
4 votes
2 answers
6
Equivalence classes of a Language
Find all the equivalence classes of Regular Language 011 (0+1)* 011
Find all the equivalence classes of Regular Language011 (0+1)* 011
User Avatar
To see more, click for the full list of questions or popular tags.