A Completeness Theorem for Probabilistic Regular Expressions
Logic in Computer Science
2024-05-20 v3 Formal Languages and Automata Theory
Abstract
We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular expressions denoting probabilistic languages in which every word is assigned a probability of being generated. We present and prove the completeness of an inference system for reasoning about probabilistic language equivalence of PRE based on Salomaa's axiomatisation of Kleene Algebra.
Cite
@article{arxiv.2310.08779,
title = {A Completeness Theorem for Probabilistic Regular Expressions},
author = {Wojciech Różowski and Alexandra Silva},
journal= {arXiv preprint arXiv:2310.08779},
year = {2024}
}
Comments
Accepted for publication at LICS. Full version of the paper containing omitted proofs