Identities of triangular Boolean matrices
Abstract
We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean n× 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.