menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
I wrote an email to IISC regarding JEST 2021 but...
B.Tech students are eligible only for Integrated...
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
sir ,it's already 17th
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
This question is taken from a sample paper
0
votes
62
views
Consider the following grammar G. Is this regular?
S →EF
E → a|∈
F → abF|ac
finite-automata
regular-languages
regular-grammar
asked
Nov 3, 2018
in
Theory of Computation
Piyush Agarwal 1
retagged
Nov 18, 2018
by
jothee
62
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
Regular
----->
(a+∈)(ab)*ac
answered
Jul 27, 2020
tech_beardo
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
1
answer
1
58
views
I came across this in a test paper
Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac
Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac
asked
Nov 3, 2018
in
Theory of Computation
Piyush Agarwal 1
58
views
regular-grammar
regular-languages
finite-automata
1
vote
1
answer
2
291
views
Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
what is the regular grammar for L={$a^nb^m$ | n+m is even}
what is the regular grammar for L={$a^nb^m$ | n+m is even}
asked
Feb 24, 2019
in
Theory of Computation
aditi19
291
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-languages
regular-expressions
regular-grammar
1
vote
0
answers
3
116
views
Peter Linz Edition 4 Exercise 3.3 Question 6 (Page No. 97)
Construct a right linear grammar for the language $L((aab^*ab)^*)$ is this grammar correct? S->aaA | ε A->bA | abA | S
Construct a right linear grammar for the language $L((aab^*ab)^*)$ is this grammar correct? S->aaA | ε A->bA | abA | S
asked
Feb 24, 2019
in
Theory of Computation
aditi19
116
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-languages
regular-grammar
3
votes
2
answers
4
1.1k
views
Need help to draw a DFA from a Right Linear grammar
.............................................................. .
.............................................................. .
asked
Nov 22, 2017
in
Theory of Computation
Tuhin Dutta
1.1k
views
theory-of-computation
finite-automata
regular-grammar
...
