Results 21 to 30 of about 302 (48)
Closures of regular languages for profinite topologies [PDF]
The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure, to compute the closure in the free group of a regular language with respect to the Hall topology.
A Moura +29 more
core +4 more sources
Tameness of pseudovariety joins involving R [PDF]
2000 Mathematics Subject Classification: 20M07 (primary); 20M05, 20M35, 68Q70 (secondary).In this paper, we establish several decidability results for pseudovariety joins of the form VvW, where V is a subpseudovariety of J or the pseudovariety R.
B Herwig +26 more
core +4 more sources
Factoriality and the pin-reutenauer procedure [PDF]
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature ...
Almeida, Jorge +2 more
core +2 more sources
Varieties of Languages in a Category
Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids.
Adamek, Jiri +3 more
core +1 more source
The rank of variants of nilpotent pseudovarieties
We investigate the rank of pseudovarieties defined by several of the variants of nilpotency conditions for semigroups in the sense of Mal'cev. For several of them, we provide finite bases of pseudoidentities.
Almeida, J., Shahzamanian, M. H.
core
ω-terms over finite aperiodic semigroups [PDF]
This paper provides a characterization of pseudowords over the pseudovariety of all finite aperiodic semigroups that are given by w-terms, that is that can be obtained from the free generators using only multiplication and the w-power.
Almeida, Jorge +2 more
core +2 more sources
Implicit operations on DS [PDF]
In this work we illustrate how the study of the topological semigroups of implicit operations of a pseudovariety V can be useful to the knowledge of V.
Azevedo, Assis
core
Commutative positive varieties of languages
We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter ...
Almeida, Jorge +2 more
core +1 more source
On the lattice of overcommutative varieties of monoids
It is unknown so far, whether the lattice of all varieties of monoids satisfies some non-trivial identity. The objective of this note is to give the negative answer to this question. Namely, we prove that any finite lattice is a homomorphic image of some
Gusev, S. V.
core +1 more source
Formalized proof, computation, and the construction problem in algebraic geometry [PDF]
An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory within a ZFC ...
Simpson, Carlos T.
core

