HomeworkLib
Question

Consider the language L below. (a) Is L a regular language? – Yes, or No. (b) If L is a regular language, design the DFA (using a State Table) to accept the language L, with the minimum number of states.  Assume Σ = {0,1}, (c) Suppose the input is “101100”. Is this input string in the language L?

L={w l w has both an even number of Os and an odd number of 1s}

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

Homework Answers

Answer #1

Given language, L={w l w has both an even number of Os and an odd number of 1s}

a)

Yes, the given language is regular language.

b)

9 %, *, 9, 1 ขอ * ข, Trasition table state diagram

c)

The given string is "101100" is not in the language.

q1 --1--> q2 --0--> q3 --1--> q2 --1--> q3 --0--> q2 --0--> q3 which is not final state.

0 0
Add a comment
Know the answer?
Add Answer to:
Consider the language L below. (a) Is L a regular language? – Yes, or No. (b)...
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

  • 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...

  • . Let Σ = { a, b } , and consider the language L = {...

    . Let Σ = { a, b } , and consider the language L = { w ∈ Σ ∗ : w contains at least one b and an even number of a’s } . Draw a graph representing a DFA (not NFA) that accepts this language.

  • Let Σ = { a, b } , and consider the language L = { a...

    Let Σ = { a, b } , and consider the language L = { a n : n is even } ∪ { b n : n is odd } . Draw a graph representing a DFA (not NFA) that accepts this language.

  • Suppose alphabet Σ = {a} and consider the following regular language A, A = {w |...

    Suppose alphabet Σ = {a} and consider the following regular language A, A = {w | |w| ≥ 4}, i.e., strings whose length is at least 4 (equivalently, unary numbers x ≥ 4). a) Construct a DFA that recognizes A with as few states as possible (draw a state diagram). b) Construct a PDA that recognizes A with as few states as possible (draw a state diagram). Note that the stack alphabet may include additional symbols.

  • Question 1. Let Σ = {a, b}, and consider the language L = {w ∈ Σ...

    Question 1. Let Σ = {a, b}, and consider the language L = {w ∈ Σ ∗ : w contains at least one b and an even number of a’s}. Draw a graph representing a DFA (not NFA) that accepts this language.

  • Show that the language L defined below is regular: L={w/ w has an even number of...

    Show that the language L defined below is regular: L={w/ w has an even number of O's and 1 is the last symbol)

  • Question 5. Let Σ = {a, b}, and consider the language L = {a^n : n...

    Question 5. Let Σ = {a, b}, and consider the language L = {a^n : n is even} ∪ {b^n : n is odd}. Draw a graph representing a DFA (not NFA) that accepts this language.

  • Question 1. Let Σ = {a, b}, and consider the language L = {w ∈ Σ...

    Question 1. Let Σ = {a, b}, and consider the language L = {w ∈ Σ ∗ : w contains at least one b and an even number of a’s}. Draw a graph representing a DFA (not NFA) that accepts this language. Question 2. Let L be the language given below. L = {a n b 2n : n ≥ 0} = {λ, abb, aabbbb, aaabbbbbb, . . .} Find production rules for a grammar that generates L.

  • 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...

  • Question 5. Let Σ = {a, b}, and consider the language L = {a n :...

    Question 5. Let Σ = {a, b}, and consider the language L = {a n : n is even} ∪ {b n : n is odd}. Draw a graph representing a DFA (not NFA) that accepts this language. Question 6. Give a brief description of the language generated by the following production rules. S → abc S → aXbc Xb → bX Xc → Ybcc bY → Yb aY → aa aY → aaX

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