In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a quantitative setting using a weight structure.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:74068 |
| Date | 01 March 2021 |
| Creators | Herrmann, Luisa |
| Contributors | Vogler, Heiko, Rahonis, George, Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:doctoralThesis, info:eu-repo/semantics/doctoralThesis, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | info:eu-repo/grantAgreement/Deutsche Forschungsgemeinschaft/GRK 1763/189782547//Quantitative Logiken und Automaten/QuantLA |
Page generated in 0.0019 seconds