Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then

A) L1 B) L1>=L2 C) L1 U L2 = .* D) L1=L2 A) L1 B) L1>=L2 C) L1 U L2 = .* D) L1=L2

For two regular languages L1 = (a + b)* a and L2 = b (a + b ) *, the intersection of L1 and L2 is given by

A) (a + b ) * ab B) ab (a + b ) * C) a ( a + b ) * b D) b (a + b ) * a A) (a + b ) * ab B) ab (a + b ) * C) a ( a + b ) * b D) b (a + b ) * a

Exam 2: Formal Languages and Automata Theory: Part B

Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production A ->aB {print "(1)" A -> c {print "1"), B ->Ab {print *2"}. When parser is aaacbbb, then string printed

(Multiple Choice)

4.8/5

(39)

Question 21

Let the class of language accepted by finite state machine be L₁ and the class of languages represented by regular expressions be L₂ then

(Multiple Choice)

5.0/5

(30)

Question 22

What is the highest type number which can be applied to the following grammar? S ->Aa, A -> Ba, B ->abc

(Multiple Choice)

4.8/5

(42)

Question 23

TM is more powerful than FSM because

(Multiple Choice)

4.8/5

(46)

Question 24

Let L₁ be a recursive language. Let L₂ and L₃ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

(Multiple Choice)

4.9/5

(40)

Question 25

If L and L¯ are recursively enumerable, then L is

(Multiple Choice)

4.9/5

(46)

Question 26

Which of the following statement is wrong?

(Multiple Choice)

4.9/5

(39)

Question 27

The language accepted by a Push down Automata:

(Multiple Choice)

4.8/5

(41)

Question 28

For two regular languages L₁ = (a + b)* a and L₂ = b (a + b ) *, the intersection of L₁ and L₂ is given by

(Multiple Choice)

4.7/5

(47)

Question 29

Which statement is true?

(Multiple Choice)

4.9/5

(45)

Question 30

Which of the following problem is undecidable?

(Multiple Choice)

4.7/5

(35)

Question 31

The following CFG is in S ? aBBspaceB ? bAAspaceA ? a**spaceB ? b

(Multiple Choice)

4.9/5

(43)

Question 32

Pumping lemma is generally used for proving that

(Multiple Choice)

4.9/5

(33)

Question 33

Match all items in Group 1 with correct options from those given in Group 2. List I List IIspaceP. Regular Expression 1) Syntax analysisspaceQ. Push down automata 2) Code GenerationspaceR. Dataflow analysis 3) Lexical analysisspaceS. Register allocation 4) Code optimization

(Multiple Choice)

4.9/5

(33)

Question 34

Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?

(Multiple Choice)

4.8/5

(40)

Question 35

All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:

(Multiple Choice)

4.7/5

(42)

Question 36

Which of the following denotes Chomskianhiearchy?

(Multiple Choice)

4.7/5

(44)

Question 37

Let S and T be language over ={a,b} represented by the regular expressions (a+b) and (a+b)*, respectively. Which of the following is true?

(Multiple Choice)

4.9/5

(41)

Question 38

If PCP is decidable then MPCP is

(Multiple Choice)

4.8/5

(39)

Question 39

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:

(Multiple Choice)

5.0/5

(26)

Question 40

Showing 21 - 40 of 50

Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production A ->aB {print "(1)" A -> c {print "1"), B ->Ab {print *2"}. When parser is aaacbbb, then string printed

Let the class of language accepted by finite state machine be L₁ and the class of languages represented by regular expressions be L₂ then

What is the highest type number which can be applied to the following grammar? S ->Aa, A -> Ba, B ->abc

TM is more powerful than FSM because

Let L₁ be a recursive language. Let L₂ and L₃ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

If L and L¯ are recursively enumerable, then L is

Which of the following statement is wrong?

The language accepted by a Push down Automata:

For two regular languages L₁ = (a + b)* a and L₂ = b (a + b ) *, the intersection of L₁ and L₂ is given by

Which statement is true?

Which of the following problem is undecidable?

The following CFG is in S ? aBBspaceB ? bAAspaceA ? a**spaceB ? b

Pumping lemma is generally used for proving that

Match all items in Group 1 with correct options from those given in Group 2. List I List IIspaceP. Regular Expression 1) Syntax analysisspaceQ. Push down automata 2) Code GenerationspaceR. Dataflow analysis 3) Lexical analysisspaceS. Register allocation 4) Code optimization

Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?

All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:

Which of the following denotes Chomskianhiearchy?

Let S and T be language over ={a,b} represented by the regular expressions (a+b) and (a+b)*, respectively. Which of the following is true?

If PCP is decidable then MPCP is

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:

Formal Languages and Automata Theory: Part A

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters

Exam 2: Formal Languages and Automata Theory: Part B

Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production A ->aB {print "(1)" A -> c {print "1"), B ->Ab {print *2"}. When parser is aaacbbb, then string printed

Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then

What is the highest type number which can be applied to the following grammar? S ->Aa, A -> Ba, B ->abc

TM is more powerful than FSM because

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

If L and L¯ are recursively enumerable, then L is

Which of the following statement is wrong?

The language accepted by a Push down Automata:

For two regular languages L1 = (a + b)* a and L2 = b (a + b ) *, the intersection of L1 and L2 is given by

Which statement is true?

Which of the following problem is undecidable?

The following CFG is in S ? aBB**spaceB ? bAA**spaceA ? a**spaceB ? b

Pumping lemma is generally used for proving that

Match all items in Group 1 with correct options from those given in Group 2. List I List II**spaceP. Regular Expression 1) Syntax analysis**spaceQ. Push down automata 2) Code Generation**spaceR. Dataflow analysis 3) Lexical analysis**spaceS. Register allocation 4) Code optimization

Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?

All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:

Which of the following denotes Chomskianhiearchy?

Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?

If PCP is decidable then MPCP is

The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:

Formal Languages and Automata Theory: Part A

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Automata and Turing Machines

Filters

Let the class of language accepted by finite state machine be L₁ and the class of languages represented by regular expressions be L₂ then

Let L₁ be a recursive language. Let L₂ and L₃ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

For two regular languages L₁ = (a + b)* a and L₂ = b (a + b ) *, the intersection of L₁ and L₂ is given by

The following CFG is in S ? aBBspaceB ? bAAspaceA ? a**spaceB ? b

Match all items in Group 1 with correct options from those given in Group 2. List I List IIspaceP. Regular Expression 1) Syntax analysisspaceQ. Push down automata 2) Code GenerationspaceR. Dataflow analysis 3) Lexical analysisspaceS. Register allocation 4) Code optimization

Let S and T be language over ={a,b} represented by the regular expressions (a+b) and (a+b)*, respectively. Which of the following is true?