Question

How to convert a Regular Expression to left-linear grammar (0+1)*00(0+1)*

Answer #1

1. Draw a GTG (generalized transition graph) for the following
right-linear regular grammar.
S -> abA
A -> baB
B->aA | bb
a) Find a left-linear grammar for the
language in the previous question.

Let L1 be the language of the Regular Expression 1(1
+ 0)*.
Let L2 be the language of the Regular Expression 11*
0.
Let L3 be the language of the Regular Expression 1*
0.
Which of the following statements are true?
L2 L1
L2 L3
L1 L2
L3 L2

Let Σ = {0, 1}. Give a regular expression that expresses the
language {w | w contains exactly two 0s}.

Which one of the following languages over the alphabet {0,1} is
described by the regular expression
(0+1)* 0 (0+1)* 0 (0+1)* ?
a.The set of all strings that begin and end with either 0 or
1
b.The set of all strings containing at most two zeros
c.The set of all strings containing at least two zeros.
d.The set of all strings containing the substring 00

Prove whether the following are regular (include regular
expression) or not regular (show proof). The alphabet is {0, 1}
Given L1 and L2 are regular, L3 = {all stings in L1, but not in
L2} Is L3 regular?
I'm not sure what theorems i can use to prove this. I appreciate
anything you can provide.

How would we convert this in Excel, income>=50k, convert to
1; If income<50k, convert to 0.

There is a regular expression below:
([0 − 9])∗55([0 − 9])∗ + ([0 − 9])∗77([0 − 9])∗ + ([0 − 9])∗8([0
− 9])∗8([0 − 9])∗8([0 − 9])∗ (contains 55, 77 or at least 3 8)
Build DFA M1 in JFLAP and show 2 strings accepted by M1 and 2
rejected by M1

Problem 4. Convert RE to CFG
We saw in class how to construct CFGs
for U, *, and
o operations for existing CFL's. We
also saw how to construct CFG's for regular expressions
empty-set, e, and c (where c is
some member of S).
a) Using these constructions, create
CFG for the RE R = x ((yx)* U
y). This is an algorithm for converting any RE to
a CFG with start variable S0. It works as follows:
create an...

What is the regular expression for the language L={w| w starts
with 1 and has odd length}? The alphabet of the language is {0,
1};

Give a regular expression for the set of all strings on the
alphabet {0,1} with no runs of length greater than 3(for example,
no substrings 0^i or 1^i with i > 3)

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 2 minutes ago

asked 14 minutes ago

asked 21 minutes ago

asked 29 minutes ago

asked 58 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago