Let A={a,b,c}.

The string abcc belongs to the set defined by the following regular expression over A:
(abc v c)*

true

The above graph is a tree. false

Give the regular expression for L(G). ba*cb

The above Boolean matrix gives a relation on the set A={1,2,3,4,5,6,7,8,9}. The matrix MR represents a tree. false

Let the above state digraph represent a Moore FSM that recognizes language L with accept state s1, and start state s0. The string aabbaababba is in the language L. true

Let A={p,q,r}. Indicate which strings belong to the set defined by the following regular expression over A:
(p v q)rq*

Choose all that apply. q pqq prq qrqq rqqqqqq prqqqqqq

How many leaves are in the tree shown above? eight Given alphabet A={0,1}, write a regular expression for the set of all strings beginning with a 0 and ending with a 1. 0(0 v 1)*1

The string abcbbbbb is in L(G). false Let A={ab, bc, ba}. The string bcabbab belongs to A*. false

The tree shown above is a 4-ary tree. true

Let the above state digraph represent a Moore FSM that recognizes language L with accept state s0, and start state s0. Give the language L as a regular expression. 1*

Give the height of the tree shown above.[Enter only a number in the text field.] 4

The above graph is connected. true

Which of the following strings are in L(G)? Choose all that apply. aabb aabaa abaaba abaaaba Aaabbb

Which of the following strings are in L(G)? Choose all that apply.

abcd bcd abbc abbcccd accbbd

Given the tree above, indicate the descendent(s) of k. c g i j k l m n d o p q Given alphabet A={0,1}, write a regular expression for the set of all strings beginning with a 0, followed by zero or more 1s, and ending with a 0. 01*0 What is the set corresponding to the sequence accdddda? {a,c,d}

Give the regular expression for L(G). x*yy*z

How many internal nodes are in the tree shown above? nine

Give the level at which vertex h is located.[Enter only a number in the text field.] 1

Let the above state digraph represent a Moore FSM that recognizes language L with accept state s1. What is the entry in the state transition table corresponding to current state s2 and input a? s0 a s1 b s2

Let the above state digraph represent a Moore FSM that recognizes language L with accept state s1, and start state s0. The string baa is in the language L. true

The tree shown above is a balanced tree. true