Log In
Construct a pda which accepts the given language L by final state
Theory of Computation/Compiler
satish
2018-01-14 13:49:51 UTC
#1
construct a pda M accepting L={a^i b^j c^k | i=j or j=k} by final state
Nirbhay
2018-01-23 06:31:06 UTC
#2
IMG_20180123_115052_HDR.jpg
3456x4608 2.07 MB
IMG_20180123_115105_HDR.jpg
3456x4608 2.56 MB
