Question

number 2 only please, could not take a smaller picture.2 Find a regular grammar that generates the language • {w | We{0,1}* , [w] >= 4; w starts with 1 and ends with 10 or 01). 3 F

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer

S -> 1M
M -> 0N | 1N
N -> 01 | 01 | 0N | 1N

Explanation

S is to start with 1
N is to end with 01 or 10

Please up vote. I need it very badly. So, please!!

Add a comment
Know the answer?
Add Answer to:
number 2 only please, could not take a smaller picture. 2 Find a regular grammar that...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Please solve it with explaining. Exercise4: Consider the language L on Σ= {0.1 } with L-(w...

    Please solve it with explaining. Exercise4: Consider the language L on Σ= {0.1 } with L-(w such that w starts with l and ends with 00 } 1. Find 3 strings accepted by the automaton 2. Show that the language L is regular

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

  • Please answer c,d,f. also please explain the answers for me to understand. For each of the...

    Please answer c,d,f. also please explain the answers for me to understand. For each of the languages below, draw the state diagram for a nondeterministic finite automaton (NFA) to accept the language. In order to get full marks, your NFA must have the number of states specified, and it must take advantage of nondeterminism. [There must be at least one case where the machine has a choice between two or more next states on some input symbol, or a case...

  • Please answer question 2 (I got 1 already). NOTE: The first picture is the exercise, the...

    Please answer question 2 (I got 1 already). NOTE: The first picture is the exercise, the second is the question (question 2)  and the third picture (with blue lines) are class-notes I took to help you answer the question correctly. Thanks. Exercise 2 Consieler en FM modulater with message mith such that fiel MIR) else where mctl - mit Freem FM modulator > x6 = Ao cos( 2 xlt a Ao cool 20 fot + 46+1) fet + foi consien free...

  • Problem 11.11 I have included a picture of the question (and the referenced problem 11.5), followed...

    Problem 11.11 I have included a picture of the question (and the referenced problem 11.5), followed by definitions and theorems so you're able to use this books particular language. The information I include ranges from basic definitions to the fundamental theorems of calculus. Problem 11.11. Show, if f : [0,1] → R is bounded and the lower integral of f is positive, then there is an open interval on which f > 0. (Compare with problems 11.5 above and Problem...

  • 1 L, as a dynamical system (Notes from Assignment #2) We take our definition of dynamical system ...

    1 L, as a dynamical system (Notes from Assignment #2) We take our definition of dynamical system to be an "object" along with a specific set of modifications that can be performed (dynamically) upon this object. In this case, the object is a bi-infinite straight road with a lamp post at every street corner and a marked lamp (the position of the lamplighter). There are two possible types of modifications: the lamplighter can walk any distance in either direction from...

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
ADVERTISEMENT