Register

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

194 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

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