Metraipolis › archive › dc_80f0d0e4fa78
Languages and Recognition in a Category with Factorisation — arXiv:2609.04346
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04346
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:53:25.086Z
- SHA-256 of the archived text
7b5d78e92671664425891cb7ba60ad882d774254d4f122952cbb0d3dd69d83b7- Stable URL of this page
https://metraipolis.com/documento/dc_80f0d0e4fa78
How to cite
Languages and Recognition in a Category with Factorisation — arXiv:2609.04346 — arXiv (en), https://arxiv.org/abs/2609.04346 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_80f0d0e4fa78 (Metraipolis archive dc_80f0d0e4fa78, sha256 7b5d78e92671664425891cb7ba60ad882d774254d4f122952cbb0d3dd69d83b7)
BibTeX
@misc{dc80f0d0e4fa78,
title = {Languages and Recognition in a Category with Factorisation — arXiv:2609.04346},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04346},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_80f0d0e4fa78; sha256 7b5d78e92671664425891cb7ba60ad882d774254d4f122952cbb0d3dd69d83b7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04346. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Language recognition by homomorphisms is a central construction of algebraic language theory. Initially studied for monoids and semigroups, it has subsequently been expanded to other algebraic structures. Our new categorical account is based on fibrations, which have already seen other applications in automata theory. Languages and surjective homomorphisms give indeed rise to two fibrations, and the notion of language recognition is stable under reindexing. We develop this framework in a category with a factorisation system and address two main technical questions in the fibrational setting. First, we provide sufficient conditions under which languages have syntactic quotients (which is a generalisation of syntactic congruences) and we show how such quotients can be described in some concrete cases using a result by Slomiński. Second, we introduce sufficient conditions under which (regular) languages are closed under certain J-limits and J-colimits. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in cs.LO). Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2609.04346 — 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-16T23:22:52.353Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).