in Theory of Computation
192 views
0 votes
0 votes
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” if needed)??

i don’t know how to solve it and would appreciate any kind of help!

studying for exam and must learn how to solve it
in Theory of Computation
by
192 views

1 Answer

0 votes
0 votes
Let L be a CFG ...S->aSb/epsilon...now if u want to make this CFG accept L* just make a move S->SS...this will concat all the incoming strings present in L*

Related questions