Register

Recent questions tagged context-free-language

0 votes
0 answers
3
CFL and regular language
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR,∑,δR,q0R,FR).
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR...
User Avatar
0 votes
0 answers
9
Can
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
User Avatar
0 votes
1 answer
10
Micheal Sipser 3rd Edition, Problem 2.36
Is the following language context free? $L=\left \{ a^ib^j\:|\: i\neq j\:and\:2i\neq j \right \}$
Is the following language context free?$L=\left \{ a^ib^j\:|\: i\neq j\:and\:2i\neq j \right \}$
User Avatar
0 votes
1 answer
14
General Doubt
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
User Avatar
0 votes
1 answer
17
Theory of Computation
Find a Greibach normal form grammar equivalent to the following CFG. S →ASB/ AB A→ a B → b
Find a Greibach normal form grammar equivalent to the following CFG.S →ASB/ ABA→ aB → b
User Avatar
1 votes
1 answer
18
toc
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
User Avatar
1 votes
1 answer
20
Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None
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
User Avatar
0 votes
1 answer
22
Context Free Languages
Is the following language context free: The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.
Is the following language context free:The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.
User Avatar
Page: