Register
Dark Mode

theory of computation

in Theory of Computation retagged by
173 views
0 votes
0 votes

The Language is given by,

L is a 

A) Deterministic CFL.

B) Non deterministic CFL but not DCFL.

I feel option A) ....if so please check the below DPDA ....Is it correct ???

in Theory of Computation retagged by
by
173 views

1 comment

by
Yes ! U are right.
1
1

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!