Skip to content
Channels - Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Search for more channels:
Similar Items: Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Channel Options
View Record
Explore related channels
Quick Look
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Quick Look
Model Checking Probabilistic Pushdown Automata
Quick Look
Good-for-games $omega$-Pushdown Automata
Quick Look
Edit Distance for Pushdown Automata
Quick Look
Bisimilarity in fresh-register 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
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Quick Look
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
Quick Look
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Quick Look
Deterministic pushdown automata can compress some normal sequences
Quick Look
Refinement and Difference for Probabilistic Automata
Quick Look
Cost Preserving Bisimulations for Probabilistic Automata
Quick Look
High-level Counterexamples for Probabilistic Automata
Quick Look
Quantitative Automata under Probabilistic Semantics
Quick Look
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Quick Look
Decision Questions for Probabilistic Automata on Small Alphabets
Quick Look
Deciding the value 1 problem for probabilistic leaktight automata
Quick Look
Model Checking Probabilistic Timed Automata with One or Two Clocks
Quick Look
FlexFringe: Modeling Software Behavior by Learning Probabilistic Automata
Quick Look
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
Quick Look
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
Load more items
View Record
Prev
Explore related channels
Next