A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Shibashis Guha,
Ismaël Jecker,
Karoliina Lehtinen
et al.
Abstract:We study the expressiveness and succinctness of history-deterministic
pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose
nondeterminism can be resolved based on the run constructed so far, but
independently of the remainder of the input word. These are also known as
good-for-games pushdown automata. We prove that HD-PDA recognise more languages
than deterministic PDA (DPDA) but not all context-free languages (CFL). This
class is orthogonal to unambiguous CFL. We further show that HD… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.