On algebraic specifications of computable algebras with the discriminator technique
G. Gagliardi, S. Tulipani (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Church-Rosser property and decidability of monadic theories of unary algebras”
On algebraic specifications of computable algebras with the discriminator technique
Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Shuffle binoids
S. L. Bloom, Z. Ésik (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On clones determined by their initial segments
J. Sichler, V. Trnková (2008)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Nondeterminism and fully abstract models
Egidio Astesiano, Gerardo Costa (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On ambiguity in DOS systems
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Homomorphic images of finite subdirectly irreducible unary algebras
Jaroslav Ježek, P. Marković, David Stanovský (2007)
Czechoslovak Mathematical Journal
Similarity:
We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty.