Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Group extensions and graphs

  • Ballester Bolinches, Adolfo
  • Cosme-Llópez, E.
  • Esteban Romero, Ramón
A classical result of Gaschütz affirms that given a finite A-generated group G and a prime p, there exists a group G# and an epimorphism phi: G# ---> G whose kernel is an elementary abelian p-group which is universal among all groups satisfying this property. This Gaschütz universal extension has also been described in the mathematical literature with the help of the Cayley graph. We give an elementary and self-contained proof of the fact that this description corresponds to the Gaschütz universal extension. Our proof depends on another elementary proof of the Nielsen-Schreier theorem, which states that a subgroup of a free group is free., This work has been supported by the grant MTM-2014-54707-C3-1-P of the Ministerio de Economia y Competitividad (Spain). The first author is also supported by Project No. 11271085 from the National Natural Science Foundation of China. The second author is supported by the predoctoral grant AP2010-2764 (Programa FPU, Ministerio de Educacion, Spain).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Algorithms for permutability in finite groups

  • Adolfo Ballester-Bolinches
  • Cosme-Llópez, Enric
  • Esteban Romero, Ramón
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP., This work has been supported by the grant MTM2010-19938-C03-01 (Ministerio de Ciencia e Innovacion, Spain). The first author has also been supported by a project of the National Natural Science Foundation of China (11271085). The third author has been supported by the predoctoral grant AP2010-2764 (Programa FPU, Ministerio de Educacion, Spain).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Formations of monoids, congruences, and formal languages

  • Ballester Bolinches, Adolfo
  • Cosme-Llópez, E.
  • Esteban Romero, Ramón
  • Rutten, J.J.M.M.
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., The authors gratefully acknowledge various discussions with Jean-Eric Pin. This work has been supported by the grants MTM2010-19938-C03-01 from the Ministerio de Ciencia e Innovacion (Spanish Government) and MTM2014-54707-C3-1-P from the Ministerio de Economia y Competitividad (Spanish Government) and FEDER (European Union). The first author has been supported by the grant No. 11271085 from the National Natural Science Foundation of China. The second author has been supported by the predoctoral grant AP2010-2764 from the Ministeriode Educacion (Spanish Government) and by an internship from CWI.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A description based on languages of the final non-deterministic automaton

  • Ballester-Bolinches, A.
  • Cosme-Llopez, E
  • Esteban Romero, Ramón
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily to what happens with deterministic automata, it is not possible to describe the behaviour up to bisimilarity of states of a non-deterministic automaton by considering just the languages associated to them. In this paper we present a description of a final object for the category of non-deterministic automata, regarded as labelled transition systems, with the help of some structures defined in terms of languages. As a consequence, we obtain a characterisation of bisimilarity of states of automata in terms of languages and a method to minimise non-deterministic automata with respect to bisimilarity of states. This confirms that languages can be considered as the natural objects to describe the behaviour of automata. (C) 2014 Elsevier B.V. All rights reserved., This work has been supported by the grant MTM2010-19938-C03-01 from the Ministerio de Ciencia e Innovacion (Spanish Government). The first author has been supported by a research project from the National Natural Science Foundation of China (NSFC, No. 11271085). The second author has been supported by the predoctoral grant AP2010-2764 from the Ministerio de Educacion (Spanish Government). We also thank Jean-Eric Pin and Jan Rutten for their helpful comments. Finally, we are indebted to the anonymous referees for their careful reading of the paper and for bringing to our attention some references we had missed. Their suggestions have helped us to improve the presentation of the paper.