Pages that link to "Item:Q1178692"
From MaRDI portal
The following pages link to Computations over finite monoids and their test complexity (Q1178692):
Displaying 8 items.
- Finite basis problem for 2-testable monoids. (Q632275) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay (Q1195687) (← links)
- (Q3363320) (← links)
- Finite Monoids: From Word to Circuit Evaluation (Q4337437) (← links)
- THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS (Q4711250) (← links)
- Some remarks on the test complexity of iterative logic arrays (Q5096825) (← links)
- Computable Følner monotilings and a theorem of Brudno (Q5156795) (← links)