Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem (Q6516094)
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 from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem |
scientific article from arXiv |
Statements
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem (English)
0 references
