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: 8)
  


Possibly Related Threads...
Thread Author Replies Views Last Post
  CS402 assignment 2 Soution spring 2018 Syra Younas 4 719 05-28-2018, 10:29 PM
Last Post: Admin
  CS402 assignment 2 spring 2018 Washi Khan 2 1,669 05-24-2018, 04:01 PM
Last Post: Syra Younas
  CS601 assignment 1 Soution spring 2018 Syra Younas 1 461 05-10-2018, 12:53 PM
Last Post: Pakistani
  Cs402 solution admin plz check this is it right Syra Younas 0 522 05-08-2018, 09:59 AM
Last Post: Syra Younas
  Cs402 help please Syra Younas 0 407 05-03-2018, 10:23 PM
Last Post: Syra Younas
  Need answer of cs0001 quiz ZS170400069 1 628 02-06-2018, 08:33 AM
Last Post: Admin
  cs402 GDB Iqra kouser 0 996 01-24-2018, 08:45 PM
Last Post: Iqra kouser
  cs402 GDB Iqra kouser 0 934 01-24-2018, 08:40 PM
Last Post: Iqra kouser
Thumbs Up cs402 Assignment jamshed Ansari 1 1,034 05-03-2017, 06:05 PM
Last Post: Admin



Users browsing this thread:
1 Guest(s)