HomeworkLib
Question

14.) Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2. This is a Formal Languages...

14.) Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2.

This is a Formal Languages and Automata question...

I need to see what the dfa for L1/L2 looks like and how you know what the final states are... Thanks!

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

L1 /L2 finite automata is nothing but L1 automata but there is s change in the final states .

from L1 automata , starting from the first state , consider the total automata .If this automata accepts any string of L2 then make first state of L1 as final state otherwise non final .

now starting from the second state , consider the total automata .If it accepts any string of L2 them make that state as the final state otherwise non final .

Repeat this process for every state to decide whether the state is final or non final .

0 0
Add a comment
Know the answer?
Add Answer to:
14.) Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2. This is a Formal Languages...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • ​Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2.

    Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2.This is a Formal Languages and Automata question.

  • Introduction to Formal Languages and Automata Theory Course Study Question. Find the equivalent DFA from the...

    Introduction to Formal Languages and Automata Theory Course Study Question. Find the equivalent DFA from the following NFA which is represented by a transition diagram. The black state represents the final (accepting) state.

  • If L1 and L2 are Regular Languages, then L1  ∪ L2  is a CFL. Group of answer choices...

    If L1 and L2 are Regular Languages, then L1  ∪ L2  is a CFL. Group of answer choices True False Flag this Question Question 61 pts If L1 and L2 are CFLs, then L1  ∩ L2 and L1 ∪ L2 are CFLs. Group of answer choices True False Flag this Question Question 71 pts The regular expression ((ac*)a*)* = ((aa*)c*)*. Group of answer choices True False Flag this Question Question 81 pts Some context free languages are regular. Group of answer choices True...

  • Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet...

    Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that the number of 0s is divisible by 2 and the number of 1s is divisible by 5. Your DFA must handle all intput strings in {0,1}*. Here is a methodical way to do this: Figure out all the final states and label each with the shortest string it accepts, work backwards from these states to...

  • Question 1: Design a DFA with at most 5 states for the language L1 = {w...

    Question 1: Design a DFA with at most 5 states for the language L1 = {w ∈ {0, 1}∗ | w contains at most one 1 and |w| is odd}. Provide a state diagram for your DFA. Approaching the Solution --since we haven’t really practiced this type of assignment (i.e. had to define our machine based on only having the language given; not the formal 5 tuples), I am providing the steps for how to work through this; you are...

  • For context the class is about Automata, Computability, and Formal Languages I just need parts b...

    For context the class is about Automata, Computability, and Formal Languages I just need parts b & e done 14. Find grammars for E = {a, b} that gener- ate the sets of (a) all strings with exactly two a's. (b) all strings with at least two a’s. (c) all strings with no more than three a's. (d) all strings with at least three a’s. (e) all strings that start with a and end with b. (f) all strings with...

  • Question 1: Every language is regular T/F Question 2: There exists a DFA that has only...

    Question 1: Every language is regular T/F Question 2: There exists a DFA that has only one final state T/F Question 3: Let M be a DFA, and define flip(M) as the DFA which is identical to M except you flip that final state. Then for every M, the language L(M)^c (complement) = L( flip (M)). T/F Question 4: Let G be a right linear grammar, and reverse(G)=reverse of G, i.e. if G has a rule A -> w B...

  • Let L1 be the line passing through thr points Q1=(-4,-5,-2) and Q2=(0,-7,2). Find a value of...

    Let L1 be the line passing through thr points Q1=(-4,-5,-2) and Q2=(0,-7,2). Find a value of k so the line L2 passing through the point P1=(7,-9,k) with direction vector d=[-1,-1,0]^t intersects with L1 K=?? Question 2 [10 points) Let Ly be the line passing through the points Or.-5. 2) and Q-0-72) Find a value of k so the line passing through the point Ps-P;(7.-9. k) with direction vector i/-/-1,-1.0" intersects with L ko

  • need help with the FBD, the unknowns, and L1 and L2 thank you In this case...

    need help with the FBD, the unknowns, and L1 and L2 thank you In this case both top and bottom supports of the PVC pipe are fixed. There is only one lever arm at the center of the pipe where torque is caused by applying weights of 5 N on each side of the hanger. Place dial gage at the point where load is applied to measure the deflection caused by it. After making the initial reading zero on the...

  • Show that L = {anbm : m ≥ n +3} is deterministic. This is for formal languages and automata... Ca...

    Show that L = {anbm : m ≥ n +3} is deterministic. This is for formal languages and automata... Can you please try to explain what you are doing and why (if necessary, if not ill try my best to figure it out.) The definitions i'm working based off of are posted as a image below. Thanks! DEFINITION 7.3 A pushdown automaton M-О. Е, Г, 0, qo, z, Fİs said to be deterministic ifit is an automaton as defined in...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT