Question

Answer

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is deterministic
context-free

Answer

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is not
accepted by any deterministic PDA

Answer

L
= {aⁿbⁿ | n ≥ 0} and is not accepted by any finite automata

Answer

L is not accepted by
any Turing machine that halts on every input

Crowdly

Want instant access to all verified answers on moodle.spit.ac.in?