Formations of monoids, congruences, and formal languages
NAGIOS: RODERIC FUNCIONANDO

Formations of monoids, congruences, and formal languages

DSpace Repository

Formations of monoids, congruences, and formal languages

Show full item record

View       (447.0Kb)

    
Ballester-Bolinches, Adolfo Perfil; Cosme i Llópez, Enric; Esteban Romero, Ramón Perfil; Rutten, J.J.M.M.
This document is a artículoDate2015

Este documento está disponible también en : http://hdl.handle.net/10550/49786
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the existence of a bijective correspondence between three concepts; formations of monoids, formations of languages and formations of congruences. The result does not require finiteness on monoids, nor regularity on languages nor finite index conditions on congruences. We relate our work to other results in the field and we include applications to non-r-disjunctive languages, Reiterman's equational description of pseudovarieties and varieties of monoids

    Ballester-Bolinches, Adolfo Cosme i Llópez, Enric Esteban Romero, Ramón Rutten, J.J.M.M. 2015 Formations of monoids, congruences, and formal languages Scientific Annals of Computer Science 25 2 171 209
http://dx.doi.org/10.7561/SACS.2015.2.171
distribuido bajo licencia Creative Commons de Reconocimiento-NoComercial 3.0 No adaptada

This item appears in the following Collection(s)

Show full item record

Search DSpace

Advanced Search

Browse

Statistics