closed by
548 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states, The state transition is as follows: Q60 Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?
A
10110
B
10010
C
01010
D
01001
closed by

Related questions

1 votes
1 votes
1 answer
1
practicalmetal asked Mar 20, 2023
358 views
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
0 votes
0 votes
1 answer
2
swami_9 asked Jul 16, 2022
525 views
Why the complement of a CFL is CSL?
1 votes
1 votes
1 answer
3
Abhipsa asked Jan 22, 2019
279 views
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!