Abstract
We show that determinacy of two-way pushdown automata languages is decidable exactly if deterministic and non-deterministic two-way pushdown automata are equivalent.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
