arXiv Open Access 2019

Tensor Product Representations of Subregular Formal Languages

Jonathan Rawski

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL cs.LO

Penulis (1)

Jonathan Rawski

Format Sitasi

APA MLA BibTeX

Rawski, J. (2019). Tensor Product Representations of Subregular Formal Languages. https://arxiv.org/abs/1908.08132

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓