Duality in Computer Science

DSpace Repository

Duality in Computer Science

Czarnetzki, Silke
Dateien:
Thumbnail
942. KB
PDF
URI: http://hdl.handle.net/10900/86540
http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-865403
http://dx.doi.org/10.15496/publikation-27928
Dokumentart: PhDThesis
Date: 2019-02-26
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Informatik
Advisor: Krebs, Andreas (Dr.)
Day of Oral Examination: 2019-01-30
DDC Classifikation: 004 - Data processing and computer science
Keywords: Topologie , Komplexitätstheorie
License: http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en
Order a printed copy: Print-on-Demand
Show full item record

Abstract:

In the regular languages, both the topological and algebraic approach have proven to be very fruitful. This thesis extends both approaches to work for non-regular languages, focused on two particular cases: 1) The visibly pushdown languages. Here, finite algebraic recognisers are developed and the topological perspective is built on this foundation. 2) Complexity- and logic classes. This part focuses in particular on the effects of the block product on the topological perspective.

This item appears in the following Collection(s)