Metraipolis › archive › dc_fdaf8ca0325b

Tree Bricks and Finite Tree Automata — arXiv:2609.22406

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22406
License (as archived)
CC0-1.0
Archived
2026-10-09T21:44:37.130Z
SHA-256 of the archived text
87e1d44cf23089ca7d4c33cc19ebe0e2bbe8f000861fdfebf7dc7a98871be345
Stable URL of this page
https://metraipolis.com/documento/dc_fdaf8ca0325b

How to cite

Tree Bricks and Finite Tree Automata — arXiv:2609.22406 — arXiv (en), https://arxiv.org/abs/2609.22406 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fdaf8ca0325b (Metraipolis archive dc_fdaf8ca0325b, sha256 87e1d44cf23089ca7d4c33cc19ebe0e2bbe8f000861fdfebf7dc7a98871be345)
BibTeX
@misc{dcfdaf8ca0325b,
  title = {Tree Bricks and Finite Tree Automata — arXiv:2609.22406},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22406},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fdaf8ca0325b; sha256 87e1d44cf23089ca7d4c33cc19ebe0e2bbe8f000861fdfebf7dc7a98871be345},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22406. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 tree to be an automata-induced tree brick when it has no non-trivial factor--image self-overlap, and use Crawley--Boevey's graph-map basis to prove that this is equivalent to brickness of the associated tree module. We also introduce local colourings of $Q_1$ and show that the arrow alphabet can be compressed without changing the tree data, graph maps, or brick property. The optimal number of colours for such a compression is the maximum of the in-degree and out-degree of $Q$. We conclude by asking whether the tree language consisting only of bricks is regular.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Formal Languages and Automata Theory (cs.FL); Representation Theory (math.RT).
Pagina del lavoro: https://arxiv.org/abs/2609.22406 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:26:41.091Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).