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

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

asked in Theory of Computation by Active (3.5k points)
edited by | 43 views

2 Answers

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

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

this is pda for this..

answered by Active (3.9k points)

Related questions

0 votes
1 answer
1
asked Oct 3, 2018 in Theory of Computation by Avik Chowdhury Junior (901 points) | 40 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
47,894 questions
52,261 answers
182,169 comments
67,679 users