Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Can
raj_uddeshya157
asked
in
Theory of Computation
Dec 27, 2023
70
views
0
votes
0
votes
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
theory-of-computation
gate-preparation
dcfl
dpda
npda
context-free-language
raj_uddeshya157
asked
in
Theory of Computation
Dec 27, 2023
by
raj_uddeshya157
70
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
Sourin Kundu
asked
in
Theory of Computation
Jul 4, 2023
238
views
PDA,DCFL and CFL
Sourin Kundu
asked
in
Theory of Computation
Jul 4, 2023
by
Sourin Kundu
238
views
theory-of-computation
npda
dpda
context-free-language
0
votes
0
votes
0
answers
2
anupamsworld
asked
in
Theory of Computation
Sep 2, 2022
527
views
PDA | TOC | Practice Question
Identify the type of the given language and draw the corresponding automata for the language. $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$ A] Regular B] DCFL C] CFL but not DCFL D] Non-CFL Please describe your selection.
anupamsworld
asked
in
Theory of Computation
Sep 2, 2022
by
anupamsworld
527
views
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
0
votes
0
votes
0
answers
3
anupamsworld
asked
in
Theory of Computation
Sep 1, 2022
268
views
PDA | TOC | Practice Question | Unacademy Class
Construct PDA using empty stack method for the given language. $L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$ //number of a’s is greater than or equal to number of b’s
anupamsworld
asked
in
Theory of Computation
Sep 1, 2022
by
anupamsworld
268
views
npda
dpda
theory-of-computation
0
votes
0
votes
2
answers
4
admin
asked
in
Theory of Computation
Mar 31, 2020
1,103
views
NIELIT 2017 DEC Scientific Assistant A - Section B: 6
Which of the following statements is true ? Melay and Moore machines are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.1k
views
nielit2017dec-assistanta
theory-of-computation
dpda
npda
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
