Zur Kurzanzeige

dc.contributor.authorBuchholz, Thomas
dc.contributor.authorKutrib, Martin
dc.date.accessioned2022-06-30T20:11:39Z
dc.date.available1998-06-22T22:00:00Z
dc.date.issued1996
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:hebis:26-opus-225
dc.identifier.urihttps://jlupub.ub.uni-giessen.de//handle/jlupub/2216
dc.identifier.urihttp://dx.doi.org/10.22029/jlupub-1986
dc.description.abstractComparisons of different cellular devices and the investigation of their computing power can be made in terms of their capabilities to time­construct and time­compute functions. Time­construction means that a distinguished cell has to enter distinguished states exactly at the time steps f(1); f(2); : : :, whereas time­computation requires the distinguished cell to enter a distinguished state firstly at time step f(n), where n is the length of the input. Here the family of functions which are time­constructible by a two­way unbounded cellular space (F(CS)) is characterized in terms of functions which are time­computable by one of the simplest cellular devices, a one­way bounded cellular automaton (C (OCA)). Conceptually, time­constructible functions have to be strictly increasing. Regarding that restriction the reverse characterization is shown, too. Some results concerning the structure of F(CS) and C(OCA) and their relation to formal language recognition are established.en
dc.language.isoende_DE
dc.relation.ispartofseriesBericht / Arbeitsgruppe Informatik; 9604 / 1996
dc.rightsIn Copyright*
dc.rights.urihttp://rightsstatements.org/page/InC/1.0/*
dc.subject.ddcddc:004de_DE
dc.titleOn the power of one-way bounded cellular time computersen
dc.typeworkingPaperde_DE
local.affiliationFB 07 - Mathematik und Informatik, Physik, Geographiede_DE
local.opus.id22
local.opus.instituteArbeitsgruppe Informatikde_DE
local.opus.fachgebietInformatikde_DE


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige

Urheberrechtlich geschützt