BibTeX
CSL-JSON
MLA
Harvard
On stack-augmented polyautomata
release_rqnko5isqvaszhtfxwwc36vdjq
by
Martin Kutrib,
Universitätsbibliothek Gießen
Published
by Universitätsbibliothek Gießen.
1998
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.
In text/plain format
Archived Files and Locations
application/pdf
292.2 kB
file_6hxhp5hdcbdpll7skuj26jista
|
jlupub.ub.uni-giessen.de (publisher) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Datacite Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Datacite Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar