Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged regular-language
0
votes
1
answer
31
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) .
upasesharanesh
asked
in
Theory of Computation
Apr 6, 2023
by
upasesharanesh
342
views
finite-automata
regular-language
regular-expression
strings
0
votes
1
answer
32
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
practicalmetal
asked
in
Theory of Computation
Mar 25, 2023
by
practicalmetal
378
views
regular-language
theory-of-computation
finite-automata
0
votes
0
answers
33
#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.
amit166
asked
in
Theory of Computation
Feb 13, 2023
by
amit166
354
views
theory-of-computation
regular-language
context-free-language
0
votes
0
answers
34
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) ∗ ).
Silver_Reaper
asked
in
Theory of Computation
Feb 6, 2023
by
Silver_Reaper
506
views
theory-of-computation
regular-language
grammar
peter-linz
0
votes
0
answers
35
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
TusharKumar
asked
in
Theory of Computation
Jan 21, 2023
by
TusharKumar
320
views
multiple-selects
regular-language
theory-of-computation
made-easy-test-series
0
votes
0
answers
36
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}
moe12leb
asked
in
Theory of Computation
Jan 21, 2023
by
moe12leb
256
views
theory-of-computation
regular-language
context-free-grammar
0
votes
0
answers
37
toc
is it a regular language? why?
someshawasthi
asked
in
Theory of Computation
Jan 17, 2023
by
someshawasthi
361
views
theory-of-computation
regular-language
0
votes
1
answer
38
is (a , b)* and (a*b*) are same ?
Mikdhad
asked
in
Theory of Computation
Jan 14, 2023
by
Mikdhad
1.5k
views
theory-of-computation
regular-language
strings
0
votes
1
answer
39
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*)*
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
752
views
theory-of-computation
regular-language
regular-expression
finite-automata
1
vote
1
answer
40
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
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
303
views
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
0
votes
0
answers
41
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
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
237
views
theory-of-computation
regular-language
finite-automata
0
votes
1
answer
42
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
Souvik33
asked
in
Theory of Computation
Dec 27, 2022
by
Souvik33
497
views
theory-of-computation
finite-automata
regular-language
made-easy-test-series
0
votes
0
answers
43
Show that the language L = {an : n ≥ 0, n != 3} is regular.
tesfaye
asked
in
Theory of Computation
Dec 19, 2022
by
tesfaye
577
views
regular-language
0
votes
2
answers
44
Every Regular language has an equivalent NFA ?? True/False
R ji
asked
in
Theory of Computation
Dec 15, 2022
by
R ji
544
views
theory-of-computation
regular-language
0
votes
1
answer
45
could you help me with this made easy question?
I tried to solve but got stuck here.
farmanahmed888
asked
in
Theory of Computation
Dec 14, 2022
by
farmanahmed888
395
views
theory-of-computation
regular-language
dcfl
made-easy-test-series
2
votes
0
answers
46
#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?
Sunnidhya Roy
asked
in
Theory of Computation
Dec 11, 2022
by
Sunnidhya Roy
376
views
theory-of-computation
closure-property
regular-language
0
votes
0
answers
47
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 ?
Shreya2002
asked
in
Theory of Computation
Dec 1, 2022
by
Shreya2002
310
views
theory-of-computation
regular-language
closure-property
made-easy-test-series
0
votes
0
answers
48
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.
vishnu777
asked
in
Theory of Computation
Nov 24, 2022
by
vishnu777
215
views
theory-of-computation
self-doubt
regular-language
2
votes
1
answer
49
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?
Pranavpurkar
asked
in
Theory of Computation
Nov 11, 2022
by
Pranavpurkar
415
views
theory-of-computation
test-series
minimal-state-automata
regular-language
0
votes
0
answers
50
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?
Chaitanya Kale
asked
in
Theory of Computation
Nov 5, 2022
by
Chaitanya Kale
349
views
theory-of-computation
regular-language
0
votes
1
answer
51
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
moe12leb
asked
in
Theory of Computation
Nov 5, 2022
by
moe12leb
307
views
theory-of-computation
regular-language
finite-automata
0
votes
1
answer
52
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
moe12leb
asked
in
Theory of Computation
Nov 2, 2022
by
moe12leb
299
views
theory-of-computation
regular-language
0
votes
1
answer
53
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?
shallowfalcon
asked
in
Theory of Computation
Oct 17, 2022
by
shallowfalcon
432
views
theory-of-computation
pumping-lemma
regular-language
Page:
« prev
1
2
3
4
5
6
7
...
24
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged regular-language
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...