Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.16113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability of equational theories, and algebraic descriptions of certain classes of recognizable languages.