Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-language
0
votes
1
answer
31
TOC Query
For $S \rightarrow 0S1 | \epsilon$ for $\sum=\{0,1\}^*$, which of the following is wrong for the language produced? (a) Non regular language (b) $0^n1^n | n\geq0$ (c) $0^n1^n | n\geq1$ (d) None of the mentioned
For $S \rightarrow 0S1 | \epsilon$ for $\sum=\{0,1\}^*$, which of the following is wrong for the language produced?(a) Non regular language(b) $0^n1^n | n\geq0$(c) $0^n1^...
Mani Kanta seela
418
views
Mani Kanta seela
asked
May 3, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
32
Finite automata and formal languages
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
upasesharanesh
344
views
upasesharanesh
asked
Apr 6, 2023
Theory of Computation
finite-automata
regular-language
regular-expression
strings
+
–
0
votes
1
answer
33
Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
practicalmetal
379
views
practicalmetal
asked
Mar 25, 2023
Theory of Computation
regular-language
theory-of-computation
finite-automata
+
–
0
votes
0
answers
34
#TIFR
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is, $\sum^* - \text{ L}$ is denoted by $L'$. Which of the following is ... d) $L$ is a context-free language and $L'$ is not a context-free language. (e) Neither is $L$ a context-free language nor is $L'$ a context-free language.
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is,...
amit166
367
views
amit166
asked
Feb 13, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
0
votes
0
answers
35
An Introduction to Formal Languages and Automata,Peter Linz,6th edition,exercise 3.3 q3
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
Silver_Reaper
516
views
Silver_Reaper
asked
Feb 6, 2023
Theory of Computation
theory-of-computation
regular-language
grammar
peter-linz
+
–
0
votes
0
answers
36
Made Easy Gate Mock -1
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
TusharKumar
328
views
TusharKumar
asked
Jan 21, 2023
Theory of Computation
multiple-selects
regular-language
theory-of-computation
made-easy-test-series
+
–
0
votes
0
answers
37
derive a language from a grammar
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
moe12leb
263
views
moe12leb
asked
Jan 21, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-grammar
+
–
0
votes
0
answers
38
toc
is it a regular language? why?
is it a regular language? why?
someshawasthi
356
views
someshawasthi
asked
Jan 17, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
39
is (a , b)* and (a*b*) are same ?
Mikdhad
1.7k
views
Mikdhad
asked
Jan 14, 2023
Theory of Computation
theory-of-computation
regular-language
strings
+
–
0
votes
1
answer
40
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
M_Umair_Khan42900
781
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
regular-expression
finite-automata
+
–
1
votes
1
answer
41
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language.L= (a²ⁿ b³ⁿ | n ≥ 0}
M_Umair_Khan42900
298
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
+
–
0
votes
0
answers
42
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular.a) (0²ⁿ |...
M_Umair_Khan42900
233
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
0
votes
1
answer
43
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse
Souvik33
490
views
Souvik33
asked
Dec 27, 2022
Theory of Computation
theory-of-computation
finite-automata
regular-language
made-easy-test-series
+
–
0
votes
0
answers
44
Show that the language L = {an : n ≥ 0, n != 3} is regular.
tesfaye
617
views
tesfaye
asked
Dec 19, 2022
Theory of Computation
regular-language
+
–
0
votes
2
answers
45
Every Regular language has an equivalent NFA ?? True/False
R ji
542
views
R ji
asked
Dec 15, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
46
could you help me with this made easy question?
I tried to solve but got stuck here.
I tried to solve but got stuck here.
farmanahmed888
399
views
farmanahmed888
asked
Dec 14, 2022
Theory of Computation
theory-of-computation
regular-language
dcfl
made-easy-test-series
+
–
2
votes
0
answers
47
#Self Doubt
Suppose L1 = CFL and L2 = Regular, We are to find out whether L1 - L2 = CFL or non CFL. I have 2 approaches to this question and I am confused which is wrong: L1 - L2 = L1 intersection L2' L2 being Regular L2' is also Regular so CFL ... being Regular L2' is also Regular and every Regular Language is also CFL so CFL intersection CFL = non CFL. Can somebody please clarify my doubt?
Suppose L1 = CFL and L2 = Regular, We are to find out whether L1 – L2 = CFL or non CFL.I have 2 approaches to this question and I am confused which is wrong:L1 – L2 =...
Sunnidhya Roy
375
views
Sunnidhya Roy
asked
Dec 11, 2022
Theory of Computation
theory-of-computation
closure-property
regular-language
+
–
0
votes
0
answers
48
Made easy Theory of Computation
Which of them are not regular- (a) L={a^m b^n | n>=2023, m<=2023} (b) L={a^n b^m c^l | n=2023, m>2023, l>m} according made easy (b) is the answer but can we do like this- Let L1= {a^n |n=2023} ... ) and so L2 is regular L=L1.L2 (regular lang are closed under concatenation) therefore L is regular.this makes option (b) regular is it right approach ?
Which of them are not regular-(a) L={a^m b^n | n>=2023, m<=2023}(b) L={a^n b^m c^l | n=2023, m>2023, l>m}according made easy (b) is the answer but can we do like this-Let...
Shreya2002
305
views
Shreya2002
asked
Dec 1, 2022
Theory of Computation
theory-of-computation
regular-language
closure-property
made-easy-test-series
+
–
0
votes
0
answers
49
Toc-Self Doubt
Can anyone explain what is the meaning of saying set of some languages is another language. Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which is set of languages . If i say L is regular Does it mean L1,l2,l3...Ln are regular.
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
vishnu777
215
views
vishnu777
asked
Nov 24, 2022
Theory of Computation
theory-of-computation
self-doubt
regular-language
+
–
2
votes
1
answer
50
Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?
Consider the following language over $\sum$ = {0, 1}L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4}How many sates will min-DFA accepting L will have?...
Pranavpurkar
422
views
Pranavpurkar
asked
Nov 11, 2022
Theory of Computation
theory-of-computation
test-series
minimal-state-automata
regular-language
+
–
0
votes
0
answers
51
Cross product of dfa
The below question is from test series. In the below question I think option B will be correct and C will not be correct. (If the image is appearing too small and blur please open the image on new tab for proper visibility) Following is the counter example for option C. ... D1 x D2 i.e (q1, q2); q1 is final state of D1 and q2 is final state of D2. Is my justification correct?
The below question is from test series.In the below question I think option B will be correct and C will not be correct. (If the image is appearing too small and blur ple...
Chaitanya Kale
349
views
Chaitanya Kale
asked
Nov 5, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
52
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
moe12leb
311
views
moe12leb
asked
Nov 5, 2022
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
0
votes
1
answer
53
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
moe12leb
287
views
moe12leb
asked
Nov 2, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
Page:
« prev
1
2
3
4
5
6
7
...
24
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register