Automata theory Q2

Equivalent automata that accepts regular language is

• Turing Machine

• Linear Bounded Automata

• Push Down Automata

• Finite Automata

Equivalent automata that accepts context free language is

• Turing Machine

• Linear Bounded Automata

• Push Down Automata

• Finite Automata

Equivalent automata that accepts context sensitive language is

• Turing Machine

• Linear Bounded Automata

• Push Down Automata

• Finite Automata

Equivalent automata that accepts recursive enumerable language is

• Turing Machine

• Linear Bounded Automata

• Push Down Automata

• Finite Automata

Type 0 grammar is otherwise called as ________.

• Recursively Enumerable Language

• Context Sensitive language

• Context free language

• Regular language

Type 3 grammar is otherwise called as _________.

• Regular Language

• Recursive Language

• Context Free language

• Context Sensitive language

Type 1 grammar is otherwise called as ___________.

• Context Free Language

• Context Sensitive Language

• Regular Language

• Recursive Language

∑^k represents the set of all strings over the alphabet of length k

• True

• False

∑* = ___________?

• ∑¹ U ∑² U∑³ …

• ∑⁰ U ∑¹ U ∑² …

• {e}

• ∑² U∑³ U ∑⁴ …

∑⁺ = ___________?

• ∑¹ U ∑² U ∑³ …

• ∑⁰ U ∑¹ U ∑² …

• {e}

• ∑² U∑³ U ∑⁴ …