| dc.contributor.advisor |
Krebs, Andreas (Dr.) |
|
| dc.contributor.author |
Czarnetzki, Silke |
|
| dc.date.accessioned |
2019-02-26T09:12:47Z |
|
| dc.date.available |
2019-02-26T09:12:47Z |
|
| dc.date.issued |
2019-02-26 |
|
| dc.identifier.other |
51813699X |
de_DE |
| dc.identifier.uri |
http://hdl.handle.net/10900/86540 |
|
| dc.identifier.uri |
http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-865403 |
de_DE |
| dc.identifier.uri |
http://dx.doi.org/10.15496/publikation-27928 |
|
| dc.description.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. |
en |
| dc.language.iso |
en |
de_DE |
| dc.publisher |
Universität Tübingen |
de_DE |
| dc.rights |
ubt-podok |
de_DE |
| dc.rights.uri |
http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de |
de_DE |
| dc.rights.uri |
http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en |
en |
| dc.subject.classification |
Topologie , Komplexitätstheorie |
de_DE |
| dc.subject.ddc |
004 |
de_DE |
| dc.title |
Duality in Computer Science |
en |
| dc.type |
PhDThesis |
de_DE |
| dcterms.dateAccepted |
2019-01-30 |
|
| utue.publikation.fachbereich |
Informatik |
de_DE |
| utue.publikation.fakultaet |
7 Mathematisch-Naturwissenschaftliche Fakultät |
de_DE |
