The monoidal structure of Turing machines
From MaRDI portal
Publication:4917187
DOI10.1017/S0960129512000096zbMath1297.18002MaRDI QIDQ4917187
Publication date: 29 April 2013
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of machines, automata (18B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Soliton automata
- Soliton automata with constant external edges
- Coherence for bicategories and indexed categories
- Matching theory
- An equational axiomatization of systolic systems
- Coherence for compact closed categories
- The geometry of tensor calculus. I
- Coherence theorems via knot theory
- An algebraic model of synchronous systems
- Context-free graph grammars and concatenation of graphs
- Axiomatizing schemes and their behaviors
- Structuring the elementary components of graphs having a perfect internal matching.
- A structural approach to reversible computation
- Automata Studies. (AM-34)
- The Space and Motion of Communicating Agents
- Irreversibility and Heat Generation in the Computing Process
- Graph expressions and graph rewritings
- Advanced Linear Algebra
- Feedback, trace and fixed-point semantics
- A categorical framework for finite state machines
- Traced monoidal categories
- Quantum weakest preconditions
- Logical Reversibility of Computation
