Register
Dark Mode

closure property
[closed]

in Theory of Computation closed by
680 views
1 vote
1 vote
closed with the note: got it
CFL over a single alphabet are always->

A. dcfl

B. regular

C. dcfl but not regular

d. non regular
in Theory of Computation closed by
by
680 views

1 Answer

1 vote
1 vote

Answer is REGULAR.

For detailed answer please refer:

https://gateoverflow.in/184786/context-free-language

by

1 comment

by
a^p, where p is a prime number? Is it regular?
0
0
← 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!