• Aucun résultat trouvé

The Power of Programs over Monoids in J

N/A
N/A
Protected

Academic year: 2021

Partager "The Power of Programs over Monoids in J"

Copied!
31
0
0

Texte intégral

Références

Documents relatifs

More generally for any variety V of monoids (a variety being the undisputed best fit with the informal notion of a natural class of monoids) one can define the class P (V) of

The ordinary regularity problem for DOL languages was shown to be decidable in [7], The correspon- ding problem for infinité words is just another formulation for the DOL

More generally for any variety V of monoids (a variety being the undisputed best fit with the informal notion of a natural class of monoids) one can define the class P (V) of

This work was partially supported by the strategic project POS- DRU 107/1.5/S/77265, inside POSDRU Romania 2007-2013 co-financed by the Euro- pean Social Fund-Investing in

Furthermore, using the properties of the Green function and using the well-known theorems like Jensen’s or Jensen-Steffensen’s inequality, we give more explicit conditions

Proposition Une matrice A (resp. un endomorphisme u d’un espace de di- mension finie E) est diagonalisable si et seulement si il existe un poly- nôme annulateur de A (resp.

A key example of this is the Hopf algebra of graphs G as given in [16], where the authors derive the antipode formula and use it to obtain the celebrated Stanley’s (−1)-color

This conjecture, which is similar in spirit to the Hodge conjecture, is one of the central conjectures about algebraic independence and transcendental numbers, and is related to many