Finite Dimensional Labeled Graph Algebras.

Given a directed graph E and a labeling L, one forms the labeled graph algebra by taking a weakly left-resolving labeled space (E, L, B) and considering a generating family of partial isometries and projections. In this paper, we discuss details in the formulation of the algebras, provide examples, and formulate a process that describes the algebra given the graph and a labelling. [ABSTRACT FROM AUTHOR]