Return to search

Weighted Automata with Storage

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.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:74068
Date01 March 2021
CreatorsHerrmann, Luisa
ContributorsVogler, Heiko, Rahonis, George, Technische Universität Dresden
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, doc-type:doctoralThesis, info:eu-repo/semantics/doctoralThesis, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relationinfo:eu-repo/grantAgreement/Deutsche Forschungsgemeinschaft/GRK 1763/189782547//Quantitative Logiken und Automaten/QuantLA

Page generated in 0.0019 seconds