Results 71 to 80 of about 2,488 (95)

The Lattice of Equational Classes of Semigroups with Zero

Canadian mathematical bulletin, 1971
E. Nelson
semanticscholar   +1 more source

Structured Dynamics in the Algorithmic Agent. [PDF]

Entropy (Basel)
Ruffini G, Castaldo F, Vohryzek J.
europepmc   +1 more source

Sets of lengths in maximal orders in central simple algebras.

J Algebra, 2013
Smertnig D.
europepmc   +1 more source

Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper)

International Conference on Developments in Language Theory, 2014
A. Dicky, David Janin
semanticscholar   +1 more source

On the Partially Ordered Monoid Generated by the Operators H, S, P, Ps on Classes of Algebras☆

, 2001
B. Tasic
semanticscholar   +1 more source

ON ORDERED MONOID RINGS (Algebraic Semigroups, Formal Languages and Computation)

ON ORDERED MONOID RINGS (Algebraic Semigroups, Formal Languages and Computation)
openaire  

Naturally ordered regular semigroups with an inverse monoid transversal

Semigroup Forum, 2007
The notion of an inverse transversal of a regular semigroup is well-known. Here we investigate naturally ordered regular semigroups that have an inverse transversal. Such semigroups are necessarily locally inverse and the inverse transversal is a quasi-ideal.
M. H. Almeida Santos, T. S. Blyth
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups

Constraints, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Nieuwenhuis, Guillem Godoy
openaire   +4 more sources

On ordering constraints for deduction with built-in Abelian semigroups, monoids and groups

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 2002
It is crucial for the performance of ordered resolution or paramodulation-based deduction systems that they incorporate specialized techniques to work efficiently with standard algebraic theories E. Essential ingredients for this purpose are term orderings that are E-compatible, for the given E, and algorithms deciding constraint satisfiability for ...
Robert Nieuwenhuis, Guillem Godoy
openaire   +3 more sources

On algebraic semigroups and monoids, II

Semigroup Forum, 2013
Consider an algebraic semigroup S and its closed subscheme of idempotents, E(S). When S is commutative, we show that E(S) is finite and reduced; if in addition S is irreducible, then E(S) is contained in a smallest closed irreducible subsemigroup of S ...
M. Brion
semanticscholar   +2 more sources