FLAT Test 1

There are ________ tuples in finite state machine.

• 4

• 5

• 6

• Unlimited

Transition function maps.

• Σ * Q -> Σ

• Q * Q -> Σ

• Σ * Σ -> Q

• Q * Σ -> Q

Number of states require to accept string ends with 10.

• 3

• 2

• 1

• can't be represented

Languages of a automata is

• If it is accepted by automata

• If it halts

• If automata touch final state in its life time

• All language are language of automata

Language of finite automata is.

• Type 0

• Type 1

• Type 2

• Type 3

inite automata requires minimum _______ number of stacks.

• 1

• 0

• 2

• 3

Regular expression for all strings starts with ab and ends with bba is.

• aba*b*bba

• ab(ab)*bba

• ab(a+b)*bba

• All of the mentioned

Moore Machine is an application of:

• Finite automata without input

• Finite automata with output

• Non- Finite automata with output

• None of the mentioned

In Moore machine, output is produced over the change of:

• transitions

• states

• Both

• None of the mentioned

The output alphabet can be represented as:

• δ

• ∆

• ∑

• None of the mentioned