The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

How to know that the language needs 1 stack or more than one stack in order to know about it is regular, context-free or not.

example

L1={$a^i b^j c^k│i<j<k$}

L2={$a^i b^j c^k│i<j \ or \ k<j$}

L3={$a^i b^j c^k│i<j \ and \ k<j$}

example

L1={$a^i b^j c^k│i<j<k$}

L2={$a^i b^j c^k│i<j \ or \ k<j$}

L3={$a^i b^j c^k│i<j \ and \ k<j$}

+2 votes

Best answer

$\boldsymbol{{\color{Blue}{ L1-CSL}}}$, as we can see I,j, k are involving with two comparison at the time ,we can't do this with one stack ,two stack is required because at a time we should have to remember two aplhabet ,so it can be done by CSL not by Cfl.

${\boldsymbol{\color{Blue}{L2-CFL}} }$, yes we can see j is involving with( i or k )one comparison at time ,so we can do this by one stack .either j is comparing with i or comparing with k one at a time ,no need of two stack .

${\boldsymbol{\color{Blue}{L3-CSL}} }$, this is almost same as first one but here j is greater than both ,here also j is involving with i and k with two comparison at a time{ j >I and j>k},so two stack required.so csl.

So remember one thing when one symbol is involving with two or more two comparison at a time then it can't be cfl.

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.2k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.2k
- Theory of Computation 4k
- Compiler Design 1.6k
- Databases 3k
- CO & Architecture 2.6k
- Computer Networks 3k
- Non GATE 1k
- Others 1.3k
- Admissions 486
- Exam Queries 435
- Tier 1 Placement Questions 18
- Job Queries 56
- Projects 9

36,157 questions

43,608 answers

123,961 comments

42,860 users