Computational complementarity and shift spaces
From MaRDI portal
Publication:997483
DOI10.1016/S0960-0779(98)00300-2zbMath1115.68421WikidataQ57001734 ScholiaQ57001734MaRDI QIDQ997483
Cristian S. Calude, Marjo Lipponen
Publication date: 6 August 2007
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Cites Work
- Computational complementarity
- Automata simulating quantum logics
- Physical versus computational complementarity. I
- Deterministic automata. Simulation, universality and minimality
- Automaton logic
- On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
- Symbolic dynamics and finite automata
- An Introduction to Symbolic Dynamics and Coding
- State-identification experiments in finite automata
- On the Bound to the Memory of a Sequential Machine
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational complementarity and shift spaces
