The Gateway to Computer Science Excellence
+2 votes

Which are DCFL, CFL, or not CFL
1. ambnck
2. ambnck | m=n or n=k if m=even then m=k
3. ambnck | if m=n then n=k

in Theory of Computation by Active (1.7k points)
edited by | 1.3k views

1 Answer

+2 votes

1. ambnck; no relation given among m,n,k so it is regular. and Hence DCFL

2. ambnck; if m is even then we have to compare two times (m=n or n=k) and m=k. So it is Not CFL.

 3. ambnck; if m=n then n=k. after comparing m and n, stack will be empty so we can't compare again n and k. It is Not CFL. 

by Active (4.7k points)
Can I say power of NCFL > DCFL???

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,362 answers
105,260 users