Crossref
Reversibility of Circular Linear Cellular Automata over Finite Fields: An Exact Enumeration via the Unit Group of the Cyclic Group Algebra
Pure Mathematics for Theoretical Computer Science · 2026 · 6 (1)
DOI: 10.54216/pmtcs.060106 ↗Kurz gefasst
Fachartikel in der Zeitschrift Pure Mathematics for Theoretical Computer Science, 2026.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
(2026). Reversibility of Circular Linear Cellular Automata over Finite Fields: An Exact Enumeration via the Unit Group of the Cyclic Group Algebra. Pure Mathematics for Theoretical Computer Science, 6(1). https://doi.org/10.54216/pmtcs.060106
Vancouver
Reversibility of Circular Linear Cellular Automata over Finite Fields: An Exact Enumeration via the Unit Group of the Cyclic Group Algebra. Pure Mathematics for Theoretical Computer Science. 2026;6(1). doi:10.54216/pmtcs.060106
BibTeX
@article{euvimed2026,
title = {Reversibility of Circular Linear Cellular Automata over Finite Fields: An Exact Enumeration via the Unit Group of the Cyclic Group Algebra},
journal = {Pure Mathematics for Theoretical Computer Science},
year = {2026},
volume = {6},
number = {1},
doi = {10.54216/pmtcs.060106}
}
EUVIMED