Kutrib, MartinMartinKutrib2022-06-301998-05-251995http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-172https://jlupub.ub.uni-giessen.de/handle/jlupub/2211http://dx.doi.org/10.22029/jlupub-1981A 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 real­time, linear­time and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered.enIn Copyrightddc:004