CS402 Quiz No 3 Fall 2023

Note: Answer are 100% CORRECT and Verified

1.The language “PRIME” is an example of ________ language.

Non Regular Language

2.We have FA accepting the language L, now if we are going to find the complement of L, then we should:

Change FA final States into non final states

3.In which of the following machine, the length of output string is same to that of input string?

Melay Machine

4.The language of all strings not beginnng with 'b' partions sigma star into_______ distinct classes

Two

5.1’s complement for 01101 will be:

10010

6.for a given Moore Machine, the input string is 101010, thus the output string would be of length

Length of input String+1

7.If a language is regular language it must generate_________number of classes

Finite

8.Subtraction of binary numbers is possible through:

Both complementing and incrementing machine

9.In Melay Machine output depends on_________

Present state and present input

10.Two machines are said to be equivalent if they print________ output string when the_______input string is run on them

Same,Same