Tree Bricks and Finite Tree Automata
Let $\Lambda=KQ/I$ be a finite-dimensional zero-relation algebra. We encode Crawley--Boevey tree modules over $\Lambda$ by finite rooted trees labelled by arrows of $Q$ and their formal inverses, and construct a deterministic finite bottom-up tree automaton recognizing exactly these encodings. We define an accepted tre...