# Theory of Computation-Regular Languages and Finite Automata (GATE Computer Science): Questions 1 - 7 of 8

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 1

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

Which of the following does not belong to the context free grammar?

### Choices

Choice (4) Response

a.

Terminal symbol

b.

End Symbol

c.

Start Symbol

d.

Question does not provide sufficient data or is vague

## Question number: 2

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

________ is the process of analyzing a text, made of a sequence of tokens, to Determine its grammatical structure with respect to a given formal grammar

### Choices

Choice (4) Response

a.

paging

b.

Segmentation

c.

Parsing

d.

None of the above

## Question number: 3

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

Regular languages are very useful in

### Choices

Choice (4) Response

a.

finite automata

b.

down automate

c.

push down automata

d.

All of the above

## Question number: 4

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

The following grammar G = (N, T, P, S) N = {S, A, B, C} T = {a, b, c} P: S → aS A → bB B → cC C → a is

### Choices

Choice (4) Response

a.

is type 0 but not type 1

b.

is type 3

c.

is type 1 but not type 2

d.

None of the above

## Question number: 5

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

A finite-state machine with no output function at all is known as

### Choices

Choice (4) Response

a.

a null automaton

b.

a semi automaton

c.

a full automaton

d.

a dummy automaton

## Question number: 6

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

The graphical representation of the transition of finite automata is ________.

### Choices

Choice (4) Response

a.

E -R diagram

b.

Finite diagram

c.

state diagram

d.

All of the above

## Question number: 7

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

### Question

Consider the join of a relation R with a relation S. If R has M tuples and S has n tuples then the maximum and minimum sizes of the join respectively are

### Choices

Choice (4) Response

a.

Mn and 0

b.

M + n and Immune

c.

M + n and 0

d.

None of the above

f Page