Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems

Information and Computation - United States
doi 10.1016/j.ic.2019.05.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Probabilistic Finite-State Machines - Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
2005English

Stochastic Machines and Probabilistic Automata.

English

Leveraging Weighted Automata in Compositional Reasoning About Concurrent Probabilistic Systems

ACM SIGPLAN Notices
Computer Science
2015English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Improving Probabilistic Automata Learning With Additional Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Probabilistic Proof Systems

BRICS Report Series
1994English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Probabilistic Simple Sticker Systems

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy