The Gateway to Computer Science Excellence
0 votes
28 views
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 (5 points) | 28 views

Please log in or register to answer this question.

Related questions

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
50,737 questions
57,353 answers
198,477 comments
105,248 users