GATE CSE 1994 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1994

True or False

-0

State True or False with one line explanation:

A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).

TRUE

FALSE

GATE CSE 1994

Fill in the Blanks

-0

The regular expression for the language recognized by the finite state automation of is _________. GATE CSE 1994 Theory of Computation - Finite Automata and Regular Language Question 59 English

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is

$$n$$

$${n^2}$$

$${{n\left( {n - 1} \right)} \over 2}$$

$${{n\left( {n + 1} \right)} \over 2}$$

GATE CSE 1994

Subjective

-0

Given that language $${L_1}$$ is regular and that the language $${L_1} \cap {L_2}$$ is regular is the language $${L_2}$$ is always regular?

PREVIOUS NEXT

GATE CSE Papers

2023