A bit of nondeterminism makes pushdown automata expressive and succinct

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann

Journal title: 46th International Symposium on Mathematical Foundations of Computer Science

Journal publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik

Published year: 2021

DOI identifier: 10.4230/lipics.mfcs.2021.53