2018/01/28 by Stefan Gerdjikov, Gerdjikov, Stefan
Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1801.10063
openalex publication_date 2018/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be described in terms of natural algebraic axioms, contains the free monoids, groups, the tropical monoid, and is closed under Cartesian.