cs402 #2 quiz 2018
#1

1:
2: Finite Automaton (FA) must have __________ number of states while a language has _________ words.
3: The product of two regular languages is __________.
4: Consider the following CFG:  S->a|Xb|aYa X->Y|^          (NOTE: ^ means NULL) Y->b|X Which Non-terminals are nullable?
5: If an FA accepts a word then there must exist a path from __________.
6: If an FA has N states then it must accept the word of length
7: Which of the following should not be NULL in the context of Pumping Lemma?
8: If R is regular language and Q is any language (regular/ non-regular), then Pref( _______in _______) is regular.
9: To examine whether a certain FA accepts any words, it is required to seek the paths _______ state.
10: Which of the following is pumped to generate further strings in the definition of Pumping Lemma?
                                                                                                                                                                          


Attached Files
.docx quiz 402 2018.docx Size: 10.7 KB  Downloads: 16
Reply
#2

http://buystromectolon.com/ - Stromectol
Reply
#3

<a href=http://buystromectolon.com/>Stromectol</a>
Reply
#4

https://buystromectolon.com/ - Stromectol
Reply
#5

<a href=https://buypropeciaon.com/>Propecia</a>
Reply
#6

http://buystromectolon.com/ - Stromectol
Reply
#7

<a href=https://buyplaquenilcv.com/>Plaquenil</a>
Reply


Possibly Related Threads…
Thread / Author Replies Views Last Post
Last Post by Syra Younas
05-13-2019, 11:49 PM
Last Post by Pakistani
07-30-2018, 12:21 PM



Users browsing this thread: 1 Guest(s)