List of Theses
For advanced search options you can also view this in the Forschungsinformationssystem of the TU Dresden.
The Theory of Recognizable Tree Series
Art der Abschlussarbeit
- Borchardt, Björn
- Prof. Dr.-Ing. habil. Heiko Vogler
The theory of automata and languages looks on computations of abstract machines from a formal viewpoint. In the 1950's the investigations of this theory started with finite-state string automata, which abstract in an easy way from real computer programs. But finite-state string automata suffer from several weaknesses because of their simplicity. This is the reason for investigating more powerful concepts. In this book we establish a theory of finite-state weighted tree automata, which are one of the more powerful concepts. They model both, the performance of instructions in sequence as well as in parallel. In addition, finite-state weighted tree automata compute, for example, the time for processing a program.
- Gewichtete Baumautomaten und Baumübersetzer
- Formale Modelle zur syntaxgesteuerten Semantik
recognizable tree series
Last modified: 2020-10-26 10:29am