# Tensor Product Representations of Subregular Formal Languages

arXiv: https://arxiv.org/abs/1908.08132 · HTML: https://mlsanity.com/paper/1908.08132/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Aug 2019.

## Built on by (most cited first, 1 of 1)

- [Formal Languages and TQFTs with Defects](https://mlsanity.com/paper/2412.09688/) (2024)

## Abstract (arXiv)

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over these models define subregular classes of languages. The semantics of such statements can be compiled into tensor structures, using multilinear maps as function application for evaluation. This method is applied to consider two properly subregular languages over different string models.