eprintid: 8
rev_number: 9
eprint_status: archive
userid: 1
dir: disk0/00/00/00/08
datestamp: 1999-06-10 00:00:00
lastmod: 2023-11-22 12:02:53
status_changed: 2012-08-14 14:59:25
type: doctoralThesis
metadata_visibility: show
creators_name: Borchert, Bernd
title: Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages
ispublished: pub
subjects: ddc-510
divisions: i-110400
adv_faculty: af-11
cterms_swd: Berechnungskomplexität
abstract: Die Dissertation untersucht eine uniforme Methode, Komplexitaetsklassen zu definieren.
abstract_translated_text: The thesis studies a uniform method to define complexity classes.
abstract_translated_lang: eng
date: 1994
date_type: published
id_scheme: DOI
id_number: 10.11588/heidok.00000008
ppn_swb: 1643153765
own_urn: urn:nbn:de:bsz:16-opus-84
date_accepted: 1994-12-20
language: eng
bibsort: BORCHERTBEPREDICATEC1994
full_text_status: public
citation:   Borchert, Bernd  (1994) Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages.  [Dissertation]     
document_url: https://archiv.ub.uni-heidelberg.de/volltextserver/8/1/8_1.pdf