A Completeness Theorem for Probabilistic Regular Expressions

Wojciech Rozowski; Alexandra Silva

doi:10.1145/3661814.3662084

LICS2024Top-tier venue

A Completeness Theorem for Probabilistic Regular Expressions

Wojciech Rozowski, Alexandra Silva

arXiv DOI Publisher

2024Year

3Citations

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.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

What it claims
How it compares
Where it falls short

You ask

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

Terminal

Install the CLI

$ lune papers fulltext ea5eea42-3bcb-4481-a489-2feea7b227d2

A Completeness Theorem for Probabilistic Regular Expressions

Abstract

Ask about this paper

Your agent reads all of it.

Builds on2

Related papers