Question 1

Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;

Accepted Answer

A) (tm, 2pda) 
B) (computer, utm) 
C) (2pda, npda) 
D) (fa, pda) 
A) (tm, 2pda) 
B) (computer, utm) 
C) (2pda, npda) 
D) (fa, pda)

Question 2

How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Accepted Answer

A) n+1 
B) n+2 
C) n 
D) 2n 
A) n+1 
B) n+2 
C) n 
D) 2n

Question 3

Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Accepted Answer

A) 10 
B) 01 
C) 101 
D) 110 
A) 10 
B) 01 
C) 101 
D) 110

Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;

How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Filters

Exam 5: Automata and Turing Machines

Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;

How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Omputer Science and Theory of Computation

Filters