Register

#toc #acetestseries #tm #decidability

• retagged by
362 views
1 votes
1 votes

• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Sambit Kumar asked Sep 18, 2017
692 views
#Decidability
L={<G> | G is CFG and G is not ambiguous}.Most restrictive set of languages L belongs to is a) CFL b) TM decidable c) TM recognizable d) not TM recognizable
L={<G | G is CFG and G is not ambiguous}.Most restrictive set of languages L belongs to isa) CFLb) TM decidablec) TM recognizabled) not TM recognizable
User Avatar
1 votes
1 votes
0 answers
2
Shivansh Gupta asked Jul 6, 2017
349 views
#pda #tm #deterministic
How can a DTM can simulate a NTM, but a DPDA can not simulate a NPDA. ? Reason? I read the proedure for a DTM to simulate a NTM but can not get why its not so with pda. Any clue ?
How can a DTM can simulate a NTM, but a DPDA can not simulate a NPDA. ? Reason?I read the proedure for a DTM to simulate a NTM but can not get why its not so with pda. A...
User Avatar
0 votes
0 votes
0 answers
3
Reshu $ingh asked Jan 26, 2019
147 views
#ACETestSeries
What is the concept of dummy bits? Please explain with examples.
What is the concept of dummy bits?Please explain with examples.
User Avatar
1 votes
1 votes
2 answers
4
amrish0524 asked Nov 14, 2023
278 views
Ace Test series
Which of the following Language has Prefix property? A) L=01* B) L=0*1* c) L= {0" 1" | n>, 1} D) L= {WW | We(0+1)*}
Which of the following Language has Prefix property?A) L=01*B) L=0*1*c) L= {0" 1" | n>, 1}D) L= {WW | We(0+1)*}
User Avatar
Link Copied!