Sublinear-Time Cellular Automata and Connections to Complexity Theory

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: Karlsruhe, Karlsruher Institut für Technologie (KIT), Dissertation, 2022

Keyword: Zellularer Automat

Event: Veröffentlichung

(where): Karlsruhe

(who): KIT-Bibliothek

(when): 2022

Creator: Modanese, Augusto

Contributor: Müller-Quade, Jörn
Kutrib, Martin

DOI: 10.5445/IR/1000153071

URN: urn:nbn:de:101:1-2022120703585427962644

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:30 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

Modanese, Augusto
Müller-Quade, Jörn
Kutrib, Martin
KIT-Bibliothek

Time of origin

2022

Other Objects (12)

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Hochschulschrift

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Hochschulschrift

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Hochschulschrift

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Sublinear-Time Cellular Automata and Connections to Complexity Theory

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Efficient universal pushdown cellular automata and their application to complexity

Self-verifying cellular automata

Fast One-Way Cellular Automata

Cellular automata with sparse communication

One-dimensional pattern generation by cellular automata

Automata arrays and context-free languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

A Time Hierarchy for Bounded One-Way Cellular Automata

On time computability of functions in one-way cellular automata

Kellererweiterte Polyautomaten

Real-time language recognition by alternating cellular automata

Self-Assembling Finite Automata

Related objects

Reset password