Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Klee...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Universitätsbibliothek Leipzig
2016
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732 http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732 http://www.qucosa.de/fileadmin/data/qucosa/documents/20873/dissertation.weidner.pdf |