Let L = L1 \cap L2, where L1 and L2 are languages as defined below: L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is

A) Not recursive B) Regular C) Context free but not regular D) Recursively enumerable but not context free. A) Not recursive B) Regular C) Context free but not regular D) Recursively enumerable but not context free.

Exam 1: Formal Languages and Automata Theory: Part A

Explore all topics

Let L = L₁ \cap L₂, where L₁ and L₂ are languages as defined below: L₁ = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L₂ = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is

(Multiple Choice)

4.9/5

(41)

Question 21

Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

(Multiple Choice)

4.9/5

(42)

Question 22

Let L={w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

(Multiple Choice)

4.9/5

(32)

Question 23

Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

(Multiple Choice)

4.9/5

(40)

Question 24

The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

(Multiple Choice)

4.9/5

(41)

Question 25

Showing 21 - 25 of 25

Let L = L₁ \cap L₂, where L₁ and L₂ are languages as defined below: L₁ = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L₂ = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is

Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

Let L={w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

Formal Languages and Automata Theory: Part B

Compiler Construction and Parsing Algorithms

Compilation and Programming Languages

Filters