FLA (UNIT-1) QUIZ

Language recognized by finite automata is:

• Type 0
• Type 1
• Type 2
• Type 3

Which of the following are an application of Finite Automaton?

• Compiler Design
• Grammar Parsers
• Text Search
• All of the mentioned

A finite automata accepts:

• Any Language
• Regular Language
• Context Free Language
• Context Sensitive Language

Which of the following is a not a part of 5-tuple finite automata?

• Input alphabet
• Transition function
• Output Alphabet
• Initial State

Number of states requires accepting string ends with 10 in DFA.

• 3
• 2
• 1
• 4

Examine the following DFA: If input is 011100101, which edge is NOT traversed?

• A B
• C
• C D
• D A

An automata in which output depends only on the states of the machine is called

• An automaton without a Memory
• Automaton with a finite Memory
• Moore Machine
• Mealy Machine

In Moore Machine, suppose if Input=’101’, then the output would be of length:

• |Input|+1
• |Input|
• |Input-1|
• Cannot be predicted

Find output string for the input 0010 from the following Mealy machine

• 0101
• 1000
• 1010
• 1001

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