cs402 #2 quiz 2018
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: 1)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Need answer of cs0001 quiz ZS170400069 1 368 02-06-2018, 08:33 AM
Last Post: Admin
  cs402 GDB Iqra kouser 0 559 01-24-2018, 08:45 PM
Last Post: Iqra kouser
  cs402 GDB Iqra kouser 0 498 01-24-2018, 08:40 PM
Last Post: Iqra kouser
Thumbs Up cs402 Assignment jamshed Ansari 1 700 05-03-2017, 06:05 PM
Last Post: Admin

Users browsing this thread:
1 Guest(s)