Amit Kuber, Annoy Sengupta
Motivated by the recent work of Deaconu, Mousavand and Paquette on the connection between infinite string bricks for certain gentle algebras and Sturmian words, we develop a decorated version of a deterministic automaton, called a multi-entry inverse automaton (MIA, for short) that accepts pointed words. We then associate an MIA $\mathsf M_{Îδ}$ over $\{0,1\}$ to a string algebra $Î$, and show that strings over $Î$ can be viewed as certain equivalence classes of the pointed words accepted by $\mathsf M_{Îδ}$. By defining (weak) brick words over this MIA, we show that a finite/infinite string module (resp. band module) is a brick if and only if every word in the associated equivalence class of pointed binary words is a brick word (resp. a weak brick word) over $\mathsf M_{Îδ}$. The result of Deaconu et al. follows as an immediate consequence.