"Realizability of Parity Logic in Finite Cellular Automata."

Celestine P. Lawrence (2024)

> Home

Details and statistics

DOI: 10.25088/COMPLEXSYSTEMS.33.1.125

access: closed

type: Journal Article

metadata version: 2024-09-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/compsys/Lawrence24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/compsys/Lawrence24
Celestine P. Lawrence:
Realizability of Parity Logic in Finite Cellular Automata. Complex Syst. 33(1): 125-132 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.