The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
22 views

asked ago in Theory of Computation by Junior (747 points) | 22 views
0
  1. CFL
  2. Regular
  3. DCFL
0
please explain

1 Answer

0 votes
  • L1 = $a^{i}$$b^{j}$$c^{k}$/ i=k or j=k we can write like

$a^{k}b^{j}c^{k}$ U $a^{i}b^{k}c^{k}$ ----> it is CFL but not DCFL.

  • L2 is regular becz finite number of string is possie

  • L3 is DCFL but not regular. This is simmilar to a equal number of a's and equal number of b's which is DCFL.

answered ago by Boss (19.1k points)

Related questions

0 votes
1 answer
1
asked 3 days ago in Theory of Computation by himgta Junior (747 points) | 24 views
+1 vote
2 answers
3
asked Jul 4 in Theory of Computation by himgta Junior (747 points) | 36 views


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

36,995 questions
44,571 answers
126,781 comments
43,637 users