For each of the following regular expressions, give 2 examples
of strings that are in the...
For each of the following regular expressions, give 2 examples
of strings that are in the language described by the regular
expression, and 2 examples of strings that are not in that
language. In all cases the alphabet is {a,b}.
ab*ba*
(a ∪ ε)b*
(a ∪ b)ε*(aa ∪ bb)
Find a regular expression to describe:
The set of all strings over the alphabet {a, b,...
Find a regular expression to describe:
The set of all strings over the alphabet {a, b, c, d}
that contain exactly one a and exactly one b
So, for example, the following strings are in this
language:
ab, ba, cccbad, acbd, cabddddd, ddbdddacccc
and the following strings are NOT in this
language:
a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d,
b
10) What is the value of this prefix expression when read as an
infix expression? Draw...
10) What is the value of this prefix expression when read as an
infix expression? Draw the ordered rooted tree corresponding to the
below arithmetic expressions written in prefix notation.
a) x,/,9,3,+,x,2,4,-,7,6
b) -,x,2,/,8,4,3
c) 5,2,1,-,-,3,1,4,+,+,x
d) 9,3,/,5,+,7,2,-,x
a.)
is there tree with vertices 8 , radius 4,diamter 5? please draw
b.) draw all...
a.)
is there tree with vertices 8 , radius 4,diamter 5? please draw
b.) draw all tree with vertices 5 and not isomorphism to each
other
{wRwwR | w ∈{a,b}∗}.
prove whether it's regular or not, if it is, draw a DFSM
{wRwwR | w ∈{a,b}∗}.
prove whether it's regular or not, if it is, draw a DFSM