The language L = {aⁱ b cⁱ | i ≥ 0} over the alphabet {a, b, c} is :

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 3) Nov 2017 Official Paper

Attempt in App

Answer 1

The correct answer is option 3:

EXPLANATION

Language L = {ai b ci | i ≥ 0}

Deterministic Pushdown automata

For every push of 'a' every 'c' should be popped.

This is the deterministic context-free language because L is accepted by Deterministic Pushdown automata

Every deterministic context-free language is also a recursive language.

Therefore option 3 is correct.