Register

Formal Languages

465 views
0 votes
0 votes

Let r1= (a+b2)* ,  r2 = (a* + b*)* , r3 = (a2 + b)*

Which of the following is true?

a)L(r1) is a subset of L(r2) and L(r3) is a subset of L(r2)

b)L(r2) is a subset of L(r1) and L(r2) is a subset of L(r3)

c)L(r1) = L(r3) is a subset of L(r2)

d) L(r1) U L(r3) = L(r2)

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
2
Sambhrant Maurya asked Oct 14, 2018
350 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
1 votes
1 votes
0 answers
3
Garrett McClure asked Sep 7, 2017
2,947 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
4
Abhipsa asked Jan 22, 2019
380 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
Link Copied!