A Completeness Theorem for Probabilistic Regular Expressions
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910450855182336 |
|---|---|
| author | Różowski, Wojciech Silva, Alexandra |
| author_facet | Różowski, Wojciech Silva, Alexandra |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_08779 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Completeness Theorem for Probabilistic Regular Expressions Różowski, Wojciech Silva, Alexandra Logic in Computer Science Formal Languages and Automata Theory 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. |
| title | A Completeness Theorem for Probabilistic Regular Expressions |
| topic | Logic in Computer Science Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2310.08779 |