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

This question was previously asked in
UGC NET Computer Science (Paper 3) Nov 2017 Official Paper
View all UGC NET Papers >
  1. a regular language
  2. not a deterministic context free language but a context free language

  3. recursive and is a deterministic context free language
  4. not recursive

Answer (Detailed Solution Below)

Option 3 : recursive and is a deterministic context free language
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
13 K Users
50 Questions 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The correct answer is option 3:

EXPLANATION

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

Deterministic Pushdown automata

F1 Raju Madhuri 03.05.2021 D1

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.

Latest UGC NET Updates

Last updated on Jun 22, 2025

-> The UGC Net Admit Card has been released on its official website today.

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Context Free Languages Questions

More Context Free Languages and Pushdown Automata Questions

Get Free Access Now
Hot Links: teen patti real cash teen patti - 3patti cards game downloadable content teen patti chart