Automata arrays and context-free languages

dc.contributor.authorKutrib, Martin
dc.date.accessioned2022-09-12T09:38:47Z
dc.date.available2001-02-06T23:00:00Z
dc.date.available2022-09-12T09:38:47Z
dc.date.issued1999
dc.description.abstractFrom a biological point of view automata arrays have been employed by John von Neumann in order to solve the logical problem of nontrivial self-reproduction. From a computer scientific point of view they are a model for massively parallel computing systems. Here we are dealing with automata arrays as acceptors for formal languages. Our focus of investigations concerns their capabilities to accept the classical linguistic languages. While there are simple relations to the regular and context-sensitive ones here we shed some light on the relations to the context-free languages and some of their important subfamilies. CR Subject Classification (1998): F.1, F.4.3, B.6.1, E.1de_DE
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:hebis:26-opus-6065
dc.identifier.urihttps://jlupub.ub.uni-giessen.de//handle/jlupub/7571
dc.identifier.urihttp://dx.doi.org/10.22029/jlupub-7005
dc.language.isoende_DE
dc.relation.ispartofseriesIFIG Research Report; 9907 / 1999
dc.rightsIn Copyright*
dc.rights.urihttp://rightsstatements.org/page/InC/1.0/*
dc.subjectautomata arrayde_DE
dc.subjectcontext-free languagede_DE
dc.subject.ddcddc:004de_DE
dc.titleAutomata arrays and context-free languagesde_DE
dc.typeworkingPaperde_DE
local.affiliationFB 07 - Mathematik und Informatik, Physik, Geographiede_DE
local.opus.fachgebietInformatikde_DE
local.opus.id606
local.opus.instituteInstitut für Informatikde_DE

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Lade...
Vorschaubild
Name:
IfigReport9907.pdf
Größe:
267.89 KB
Format:
Adobe Portable Document Format