Back to results

Universität Heidelberg

Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages

Abstract

dc:description.abstract

Die Dissertation untersucht eine uniforme Methode, Komplexitaetsklassen zu definieren.

Degree

thesis:*
Level thesis:degree_level
thesis.doctoral
Grantor dc:publisher
Universität Heidelberg
Year
1994

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Borchert, Bernd

Identifiers

dc:identifier.*
Repository record source_url
http://www.ub.uni-heidelberg.de/archiv/8
OAI identifier oai:identifier
oai:archiv.ub.uni-heidelberg.de:8

Chain of custody

source
Harvested from
Universität Heidelberg
Base URL
archiv.ub.uni-heidelberg.de/volltextserver/cgi/oai2
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Borchert, Bernd. Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages. thesis.doctoral thesis, Universität Heidelberg, 1994. http://www.ub.uni-heidelberg.de/archiv/8