Recent questions tagged regular-language

2 votes
1 answer
93
Let L={w| w has even length and odd number of 0’s}. Which of the following words is in L* (Kleen Closure of L).0000010101111101010 Answer Is Given 0000
1 votes
1 answer
94
0 votes
1 answer
95
2 votes
3 answers
96
The minimum number of states in an equivalent finite automata for the given regular expression are _____(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
2 votes
2 answers
97
3 votes
3 answers
104
1 votes
3 answers
105
1 votes
7 answers
109
18 votes
7 answers
112
Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...
3 votes
3 answers
113
Which of the following is true?Every subset of a regular set is regularEvery finite subset of non-regular set is regularThe union of two non regular set is not regularInf...