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
Regular expression Theory of Computation
Snehil01
asked
in
Theory of Computation
May 27, 2023
edited
Jun 23, 2023
by
Hira Thakur
464
views
0
votes
0
votes
Answer this
theory-of-computation
regular-expression
regular-grammar
Snehil01
asked
in
Theory of Computation
May 27, 2023
edited
Jun 23, 2023
by
Hira Thakur
by
Snehil01
464
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
Option ( A ) seems correct.
rhl
answered
Jul 6, 2023
by
rhl
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
0
answers
1
Rishi yadav
asked
in
Theory of Computation
Jan 4, 2018
288
views
MadeEasy Test Series 2018: Theory Of Computation - Regular Expressions
Rishi yadav
asked
in
Theory of Computation
Jan 4, 2018
by
Rishi yadav
288
views
made-easy-test-series
theory-of-computation
regular-grammar
regular-expression
0
votes
0
votes
1
answer
2
Rahhhhhul
asked
in
Theory of Computation
Jun 12, 2023
819
views
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
Rahhhhhul
asked
in
Theory of Computation
Jun 12, 2023
by
Rahhhhhul
819
views
regular-expression
regular-language
regular-grammar
theory-of-computation
1
vote
1
vote
0
answers
3
smriti bhati
asked
in
Theory of Computation
Jan 26, 2018
309
views
MadeEasy Test Series 2018: Theory of Computation - Regular Grammer
What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. represent?
smriti bhati
asked
in
Theory of Computation
Jan 26, 2018
by
smriti bhati
309
views
theory-of-computation
regular-grammar
made-easy-test-series
0
votes
0
votes
1
answer
4
ARUN KUMAR 3
asked
in
Theory of Computation
Oct 15, 2016
743
views
MadeEasy Test Series: Theory Of Computation - Regular Grammar
The grammer {S--> aA | aB | ε, A--> Ab | ε } is (a) Regular and Linear (b) Regular but not Linear (c) Linear but not Regular (d) Neither Linear nor Regular
ARUN KUMAR 3
asked
in
Theory of Computation
Oct 15, 2016
by
ARUN KUMAR 3
743
views
made-easy-test-series
theory-of-computation
regular-grammar
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
