Register

Formal Languages

657 views
0 votes
0 votes
If G= ({S} , {a}, {S--->SS} , S), then language L(G) is

a)ϕ

b)aa(a)*

c)(aa)*

d)None of these
User Avatar

1 Answer

Best answer
1 votes
1 votes
As there is only one production in the given grammar that is S-->SS, therefore grammar does not generate any terminal and eventually does not generate any string, thus answer should be option (a) ϕ.
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Garrett McClure asked Sep 7, 2017
2,946 views
Intro to Formal Languages and Automata Peter Linz Ex. #2.1.2e
For Σ= {a,b}, construct a dfa that accepts the sets consisting of all the strings with exactly two a’s and more than two b’s.
For Σ= {a,b}, construct a dfa that accepts the sets consisting of all the strings with exactly two a’s and more than two b’s.
User Avatar
0 votes
0 votes
1 answer
3
Abhipsa asked Jan 22, 2019
375 views
Formal Languages
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} . L complement is Regular CFL but not regular CSL but not CSL DCFL
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} .L complement isRegularCFL but not regularCSL but not CSLDCFL
User Avatar
1 votes
1 votes
0 answers
4
Sambhrant Maurya asked Oct 14, 2018
348 views
Formal Languages
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)? a) L[b*ab*ab*ab*)*] b) L[b*ab*ab*)*] c) L[b*ab*ab*)6] d) L[b*ab*ab*ab*ab*ab*ab*)*]
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)?a) L[b*ab*ab*ab*)*]b) L[b*ab*ab*)*]c) L[b*ab*ab*)6]d) L[b*ab*ab*ab*ab*ab*ab*)*]
User Avatar
Link Copied!