Previous Page 11

Displaying 201 – 206 of 206

Showing per page

Axiomatization of quasigroups

Jonathan D.H. Smith (2006)

Discussiones Mathematicae - General Algebra and Applications

Quasigroups were originally described combinatorially, in terms of existence and uniqueness conditions on the solutions to certain equations. Evans introduced a universal-algebraic characterization, as algebras with three binary operations satisfying four identities. Now, quasigroups are redefined as heterogeneous algebras, satisfying just two conditions respectively known as hypercommutativity and hypercancellativity.

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2010)

RAIRO - Theoretical Informatics and Applications

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Currently displaying 201 – 206 of 206

Previous Page 11