Home » VU University » Final Term Quiz » CS402 Final Term Quiz 1

# CS402 Final Term Quiz 1

0%
7

CS402 Final Term Quiz 1

1 / 25

According to 1st part of the Kleene?s theorem, If a language can be accepted by an FA then it can be accepted by a ________ as well.

2 / 25

Below given FA has __________ RE.

3 / 25

Above given TG has _____________ RE.

4 / 25

Choose the incorrect statement:

5 / 25

Choose the correct statement.

6 / 25

A regular language:

7 / 25

Finite Automation (FA) and Nondeterministic Finite Automation (NFA) are equivalent if

8 / 25

Consider the following TM

9 / 25

Alphabet ? = {a, bc, cc} has number of letters

10 / 25

?One language can have _________ TG?s?.

11 / 25

Every regular expression can be expressed as CFG but every CFG cannot be expressed as a regular expression.This statement is:

12 / 25

An alphabet of ? is valid if

13 / 25

An FSM can be considered as TM

14 / 25

Above given FA corresponds RE r. then FA corresponding to r* will beThis statement is

15 / 25

Choose the incorrect (FALSE) statement.

16 / 25

A read state can have _______ outgoing edge/ edges.

17 / 25

For every Context Free Grammar (CFG), we can make the corresponding ______.

18 / 25

______ and _______ are removed in order to make a CFG in Chomsky Normal Form(CNF).

19 / 25

Consider the language L of strings, defined over ? = {a,b}, ending in a

20 / 25

Chomsky normal form (CYK) algorithm was proposed by ______.

21 / 25

(?* - L)resent the _______ of a language L.

22 / 25

________ is always Deterministic.

23 / 25

Above given TGresents the language i.e.

24 / 25

?One language can be expressed by more than one FA?. This statement is ______

25 / 25

Even-palindrome is a _______ language.