Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Geometric Parallelism Enforces Parallel Algorithms Read chapter Read first chapter

1981 | OriginalPaper | Chapter

On Cellular Automata with a Finite Number of State Changes

Author : Prof. Dr.-Ing. R. Vollmar

Published in: Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten

Publisher: Springer Vienna

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

On Cellular Automata with a Finite Number of State Changes. The number of state changes is introduced as a complexity measure for the recognition of languages in cellular automata. The relation of the simplest class — i.e. the one with a constant number of changes per single automaton — to the Chomsky hierarchy is investigated and a comparison with sequential tape complexity is made.

previous chapter Algebraic Specification of the Software Controlling a Parcels Distribution Machine
next chapter Models to Describe Those Features of Cellular Computer Nets Which Are Relevant to the Operating System
Metadata
Title
On Cellular Automata with a Finite Number of State Changes
Author
Prof. Dr.-Ing. R. Vollmar
Copyright Year
1981
Publisher
Springer Vienna
Book
Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten

Print ISBN: 978-3-211-81606-6

Electronic ISBN: 978-3-7091-8596-4

Copyright Year: 1981

DOI
https://doi.org/10.1007/978-3-7091-8596-4_13