Download PDFOpen PDF in browser

Residuated Lattices, Regular Languages, and Burnside Problem

2 pagesPublished: July 28, 2014

Abstract

In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices.

Keyphrases: Burnside problem, finite embeddability property, generalized Myhill theorem, regular language, residuated lattice

In: Nikolaos Galatos, Alexander Kurz and Constantine Tsinakis (editors). TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, vol 25, pages 6--7

Links:
BibTeX entry
@inproceedings{TACL2013:Residuated_Lattices_Regular_Languages,
  author    = {Rostislav Horcik},
  title     = {Residuated Lattices, Regular Languages, and Burnside Problem},
  booktitle = {TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic},
  editor    = {Nikolaos Galatos and Alexander Kurz and Constantine Tsinakis},
  series    = {EPiC Series in Computing},
  volume    = {25},
  pages     = {6--7},
  year      = {2014},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/32},
  doi       = {10.29007/76p1}}
Download PDFOpen PDF in browser