Register

Context Free Languages(CFG) Push Down Anutomata(PDA)

221 views

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

714
views
1 answers
0 votes
hrcule asked Mar 21, 2018
714 views
Context free grammar and push down automata.
Is true..? In an unambiguous grammar every string has exactly one derivation.
User Avatar
600
views
1 answers
0 votes
practicalmetal asked Mar 20, 2023
600 views
Context Free Languages
Is the following language CFL :{ ww | w in (a+b)* and |w| <1000 }
User Avatar
550
views
1 answers
0 votes
practicalmetal asked Mar 15, 2023
550 views
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.
User Avatar
940
views
1 answers
1 votes
Anmol Verma asked Dec 2, 2016
940 views
cfg pda toc
how $a^nb^nc^n$ n>=1 is not CFL....??
User Avatar
Link Copied!