Characterisation of (Sub)sequential Rational Functions over a General Class Monoids
Formal Languages and Automata Theory
2018-01-31 v1 Computation and Language
Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.1801.10063,
title = {Characterisation of (Sub)sequential Rational Functions over a General Class Monoids},
author = {Stefan Gerdjikov},
journal= {arXiv preprint arXiv:1801.10063},
year = {2018}
}