The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
32 views

Q. {al bm cn | l ≠ m or m ≠ n}  construct a PDA for this language?

asked in Theory of Computation by Junior (747 points)
edited by | 32 views

2 Answers

0 votes
  • Given language is CFL so we can construct pda .

answered by Boss (19.1k points)
0
please provide the transition diagram of the resultant PDA
0 votes

this is pda for this..

answered ago by Active (2.5k points)


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,779 comments
43,637 users