Formal Language and Automata

Regular languages are recognized by

• Turing Machine

• Pushdown Automata

• Linear Bounded Automata

• Finite Automata

Type 2 grammar is also known as

• Context Sensitive Grammar

• Context Free Grammar

• Regular Grammar

• Recursively Enumerable Grammar

Is Every NFA has an equivalent DFA.

• Yes

• No

• May be

• Maynot be

Is Every DFA has an Equivalent NFA?

• Yes

• No

• May be

• May not be

______ is used to represent regular langugaes.

• Context Free Grammar

• Regular Expression

• Productions

• Set of Rules

_____ recognizes context free languages

• Finite Automata

• Linear Bounded Automata

• Pushdown Automata

• Turing Machine

___ data structure is used in PDA to store the input symbols.

• List

• Queue

• Tree

• Stack

___ recognizes recursive languages.

• Finite Automata

• Linear bounded Automata

• Pushdown Automata

• Turing Machine

Choose the chomskian hiersrchy of languages.

The input tape in the Turing Machine contains

• Blank Symbols

• Terminals

• Non terminals

• Variables