6 Words, non–commutative polynomials: free monoids and free algebras

endomorphism, open continuous map, complete Heyting homomor- phism, strong graph homomorphism, Hausdorff property.. The authors gratefully acknowledge the support of

Any algebraically closed simple object can be considered as a ground graded field in which we take values. Then any adequately finitely pre- sentable object A in

A standard Galerkin mixed method (G) and the Galerkin method enriched with residual-free bubbles (RFB) for equal order linear elements are considered to approximate the displacement

Although the ambiguity of morphisms with an infinite target alphabet regarding prolix patterns and, thus, erasing morphisms, offers a wider spectrum of results than regarding

In addition, coding properties of finite sets of words are explored by finding maximal and minimal relations with respect to relational codes.. The base of a free word monoid is

The diamond product is the counterpart of the Schützenberger product for partially commutative monoids (the "trace monoids"). We find that the diamond product recognizes

If we do not restrict the matrix A to be positive it is notable that even for matrices with coefficients of small size then the polynomial Q of proposition 3 can have a relatively

- In a free monoid endowed with the finite group topology we consider an equality set of morphisms and prove thaï it is nowhere