Skip to content
<title>Channels - A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Search for more channels:
Similar Items: A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Channel Options
View Record
Explore related channels
Quick Look
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Quick Look
Edit Distance for Pushdown Automata
Quick Look
Model Checking Probabilistic Pushdown Automata
Quick Look
Good-for-games $omega$-Pushdown Automata
Quick Look
Beyond Language Equivalence on Visibly Pushdown Automata
Quick Look
Model-Checking of Ordered Multi-Pushdown Automata
Quick Look
Reachability Problem for Weak Multi-Pushdown Automata
Quick Look
Minimization of visibly pushdown automata is NP-complete
Quick Look
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Quick Look
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
Quick Look
Deterministic pushdown automata can compress some normal sequences
Quick Look
A Hierarchy of Nondeterminism
Quick Look
On the Expressive Power of Higher-Order Pushdown Systems
Quick Look
On the Succinctness of Atoms of Dependency
Quick Look
Mixed powerdomains for probability and nondeterminism
Quick Look
The succinctness of first-order logic on linear orders
Quick Look
Step-Indexed Relational Reasoning for Countable Nondeterminism
Quick Look
Interaction and Depth against Nondeterminism in Proof Search
Quick Look
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism
Quick Look
The Theory of Traces for Systems with Nondeterminism, Probability, and Termination
Quick Look
Countdown games, and simulation on (succinct) one-counter nets
Quick Look
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism
Quick Look
Hardness of monadic second-order formulae over succinct graphs
Quick Look
Reachability Analysis of Communicating Pushdown Systems
Load more items
View Record
Prev
Explore related channels
Next
