On time computability of functions in one-way cellular automata

to related objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Bericht / Arbeitsgruppe Informatik ; 9502 / 1995

Event
Veröffentlichung
(where)
Gießen
(who)
Universitätsbibliothek
(when)
1998
Creator
Buchholz, Thomas
Kutrib, Martin

URN
urn:nbn:de:hebis:26-opus-189
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 11:02 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

Time of origin

  • 1998

Other Objects (12)

Fast One-Way Cellular Automata

Fast One-Way Cellular Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On the power of one-way bounded cellular time computers

On the power of one-way bounded cellular time computers

One guess one-way cellular arrays

One guess one-way cellular arrays

Automata arrays and context-free languages

Automata arrays and context-free languages

Efficient universal pushdown cellular automata and their application to complexity

Efficient universal pushdown cellular automata and their application to complexity

Kellererweiterte Polyautomaten

Hochschulschrift

Kellererweiterte Polyautomaten

Self-verifying cellular automata

Self-verifying cellular automata

Self-Assembling Finite Automata

Self-Assembling Finite Automata

Cellular automata with sparse communication

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

One-dimensional pattern generation by cellular automata

Flip-Pushdown Automata: Nondeterminism is Better Than Determinism

Flip-Pushdown Automata: Nondeterminism is Better Than Determinism

Related objects