📝 SummarXiv

Abstract

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.