Explorability in pushdown automata

DOI10.4230/LIPICS.FSTTCS.2025.12MaRDI QIDQ7391884zbMATH OpenFDO

Authors Ayaan Bedi, Karoliina Lehtinen

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.12

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A bit of nondeterminism makes pushdown automata expressive and succinct
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Explorable automata
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Limited nondeterminism of input-driven pushdown automata: decidability and complexity
• Measuring nondeterminism in pushdown automata
• On the Succinctness of Different Representations of Languages
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Removing nondeterminism in constant height pushdown automata
• Solving Games Without Determinization

This page was built for publication: Explorability in pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391884)