Termination of rewriting on reversible Boolean circuits as a free 3-category problem (Q6664060)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Termination of rewriting on reversible Boolean circuits as a free 3-category problem |
scientific article; zbMATH DE number 7967953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Termination of rewriting on reversible Boolean circuits as a free 3-category problem |
scientific article; zbMATH DE number 7967953 |
Statements
Termination of rewriting on reversible Boolean circuits as a free 3-category problem (English)
0 references
16 January 2025
0 references
reversible Boolean circuits
0 references
reversible computing
0 references
n-categories
0 references
polygraphs
0 references
rewriting
0 references