On stack-augmented polyautomata
| dc.contributor.author | Kutrib, Martin | |
| dc.date.accessioned | 2022-06-30T20:11:37Z | |
| dc.date.available | 1998-05-25T22:00:00Z | |
| dc.date.issued | 1995 | |
| dc.description.abstract | A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of realtime, lineartime and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered. | en |
| dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-172 | |
| dc.identifier.uri | https://jlupub.ub.uni-giessen.de//handle/jlupub/2211 | |
| dc.identifier.uri | http://dx.doi.org/10.22029/jlupub-1981 | |
| dc.language.iso | en | de_DE |
| dc.relation.ispartofseries | Bericht / Arbeitsgruppe Informatik; 9501 / 1995 | |
| dc.rights | In Copyright | * |
| dc.rights.uri | http://rightsstatements.org/page/InC/1.0/ | * |
| dc.subject.ddc | ddc:004 | de_DE |
| dc.title | On stack-augmented polyautomata | en |
| dc.type | workingPaper | de_DE |
| local.affiliation | FB 07 - Mathematik und Informatik, Physik, Geographie | de_DE |
| local.opus.fachgebiet | Informatik | de_DE |
| local.opus.id | 17 | |
| local.opus.institute | Arbeitsgruppe Informatik, Universität Giessen | de_DE |
Dateien
Originalbündel
1 - 1 von 1