This lecture shows that tree-walking automata cannot be determinised. This page is, for now, just a stub. The proof can be found in this paper that Nadara despises.
Your email address will not be published. Required fields are marked *
Comment *
Name
Website
Save my name, email, and website in this browser for the next time I comment.
Δ
Leave a Reply