Syntactic Structures of Regular Languages

2016/12/19 by Ondřej Klíma, Klíma, Ondřej, Libor Polák +1
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL

paper · pdf · doi:10.48550/arxiv.1612.06247

arxiv created 2017/11/29 · arxiv updated 2017/11/30

Abstract

We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.

Related

• Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
• Syntactic Monoids in a Category
• Regular Monoidal Languages
• Syntactic Complexity of Regular Ideals
• Syntactic Complexity of Star-Free Languages