NAGIOS: RODERIC FUNCIONANDO

Formations of monoids, congruences, and formal languages

Repositori DSpace/Manakin

IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/

Formations of monoids, congruences, and formal languages

dc.contributor.author	Ballester-Bolinches, Adolfo
dc.contributor.author	Cosme i Llópez, Enric
dc.contributor.author	Esteban Romero, Ramón
dc.contributor.author	Rutten, J.J.M.M.
dc.date.accessioned	2016-01-07T09:21:59Z
dc.date.available	2016-01-07T09:21:59Z
dc.date.issued	2015
dc.identifier.citation	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
dc.identifier.uri	http://hdl.handle.net/10550/49786
dc.description.abstract	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
dc.language.iso	eng
dc.relation.ispartof	Scientific Annals of Computer Science, 2015, vol. 25, num. 2, p. 171-209
dc.subject	Llenguatges de programació
dc.subject	Àlgebra
dc.title	Formations of monoids, congruences, and formal languages
dc.type	journal article	es_ES
dc.date.updated	2016-01-07T09:22:00Z
dc.identifier.doi	10.7561/SACS.2015.2.171
dc.identifier.idgrec	108975 140350
dc.rights.accessRights	open access	es_ES