Register

Context free language

217 views

1 Answer

0 votes
0 votes
one stack means a machine is a  PDA

two stacks means the machine is Turing
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

142
views
0 answers
0 votes
dazeeee asked Apr 3
142 views
Context Free language sample question
Give a context-free grammar for each of the following languages. Consider, Σ={0,1}.A. The language of strings that start with 1B. The language of strings of the form WWR C. The ... | j is a multiple of four or i = 3 + 2j where i, j ≥ 0}
User Avatar
405
views
1 answers
1 votes
practicalmetal asked Mar 20, 2023
405 views
Context Free Language
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
587
views
1 answers
0 votes
swami_9 asked Jul 16, 2022
587 views
Context free language
Why the complement of a CFL is CSL?
User Avatar
320
views
1 answers
1 votes
Abhipsa asked Jan 22, 2019
320 views
Context free language
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!
User Avatar
Link Copied!