Register

I came across this in a test paper

• retagged by
214 views

1 Answer

0 votes
0 votes
Language generated by this grammar = {ac,aac,abac,aabac -------}

Yes we make a DFA ending with ac, Regular expression can be written as (a+b)*ac. So it is Regular.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Piyush Agarwal 1 asked Nov 3, 2018
237 views
This question is taken from a sample 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 →EFE → a|∈F → abF|ac
User Avatar
1 votes
1 votes
0 answers
3
aditi19 asked Feb 24, 2019
527 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
User Avatar
Link Copied!