Results 171 to 180 of about 405,218 (197)
Some of the next articles are maybe not open access.

The Monoids of Order Eight and Nine

2008
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of order 9 or less. Our approach is novel, using computer algebra to break symmetry and constraint satisfaction search to find candidate solutions.
Andreas Distler, Tom W. Kelsey
openaire   +1 more source

The monoids of orders eight, nine & ten

Annals of Mathematics and Artificial Intelligence, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Distler, Tom W. Kelsey
openaire   +3 more sources

Conrad’s F-condition for partially ordered monoids

Soft Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pengyuan Liu   +2 more
openaire   +3 more sources

On Morita Equivalence of Partially Ordered Monoids

Applied Categorical Structures, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS

International Journal of Algebra and Computation, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
X. Wang, Stephen J. Pride
openaire   +2 more sources

Finite J-Trivial Monoids and Partially Ordered Monoids

1987
An important result in the theory of automata, due to Imre Simon, characterizes the recognizable languages whose syntactic monoids are J-trivial. This theorem has an easy, although not entirely obvious, restatement as a global structure theorem for finite J-trivial monoids, asserting that every finite J-trivial monoid is a quotient of a finite monoid ...
Howard Straubing, Denis Thérien
openaire   +1 more source

Inverse Monoids With a Natural Semilattice Ordering

Proceedings of the London Mathematical Society, 1995
The thesis of this paper is that many naturally occurring examples of inverse semigroups are endowed with extra structure; typically, they are inverse monoids in which the natural partial order forms a meet semilattice. Inverse semigroups of this kind the author terms inverse algebras.
openaire   +2 more sources

Orbit decompositions of orthogonal monoids and the orders of finite orthogonal monoids

Semigroup Forum, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, You'an, Li, Zhenheng, Lei, Jie
openaire   +1 more source

And... Action! – Monoid Actions and (Pre)orders

2014
Orders occur naturally in many areas of computer science and mathematics. In several cases it is very simple do describe an order mathematically, but it may be cumbersome to implement in some programming language. On the other hand many order relations are defined in terms of an existential quantification.
openaire   +1 more source

Algorithm for Generating Finite Totally Ordered Monoids

2016
The semantics of fuzzy logic is typically based on negative totally ordered monoids. This contribution describes an algorithm generating in a step-wise fashion all finite structures of this kind.
Milan Petrík, Thomas Vetterlein
openaire   +3 more sources

Home - About - Disclaimer - Privacy