Register

Formal Languages

685 views
0 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)

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Formal LanguagesNext → · Formal Languages
← Previous in category · Formal LanguagesNext in category → · Formal Languages
Position:
Show:

Related questions

0 0 votes
0 0 answers
809
809 views
Silver_Reaper asked Feb 6, 2023
809 views
An Introduction to Formal Languages and Automata,Peter Linz,6th edition,exercise 3.3 q3
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
1 1 vote
0 0 answers
787
787 views
Sambhrant Maurya asked Oct 14, 2018
787 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*)*]
1 1 vote
0 0 answers
3.3k
3.3k views
Garrett McClure asked Sep 7, 2017
3,315 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.
0 0 votes
1 answers 1 answer
735
735 views
Abhipsa asked Jan 22, 2019
735 views
Formal Languages
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} .L complement isRegularCFL but not regularCSL but not CSLDCFL