Amanote Research

Amanote Research

    RegisterSign In

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-39300-1_8
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2016

Authors
Alonso Castillo-RamirezMaximilien Gadouleau
Publisher

Springer International Publishing


Related search

ACME: Automata With Counters, Monoids and Equivalence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Remark on Finite Dimensional Compact Connected Monoids

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1974English

On Free Spectra of a Class of Finite Inverse Monoids

Journal of the Australian Mathematical Society
Mathematics
2012English

Finite-State Automata on Infinite Inputs

2012English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Asynchronous Cellular Automata

2018English

Special Issue on Simulation With Cellular Automata

Simulation
Computer GraphicsSimulationComputer-Aided DesignModelingMathematicsSoftware
2016English

On Generative Morphological Diversity of Elementary Cellular Automata

Kybernetes
ControlSystems EngineeringInformation SystemsElectronic EngineeringEngineeringElectricalComputer ScienceTheoretical Computer ScienceSocial SciencesArtificial IntelligenceSoftware
2010English

Combinatorial Group Theory, Inverse Monoids, Automata, and Global Semigroup Theory

International Journal of Algebra and Computation
Mathematics
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy