Dualizability of automatic algebras.

DOI10.1016/j.jpaa.2013.11.020zbMath1306.08007arXiv1210.1475OpenAlexW1969394284MaRDI QIDQ2436718

Yanyan Li

Publication date: 26 February 2014

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1475

zbMATH Keywords

dualizabilitydualizable algebrasfinite automatic algebrasnon-dualizable algebrasnon-finitely based equational theoriespartial automata

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Equational logic, Mal'tsev conditions (08B05) Quasivarieties (08C15) Natural dualities for classes of algebras (08C20)

Related Items (3)

General algebra and its applications 2013: problem session. ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ Natural dualities, nilpotence and projective planes

Cites Work

• Unnamed Item
• Unnamed Item
• A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
• Natural dualities, nilpotence and projective planes
• Dualisability versus residual character: a theorem and a counterexample
• Inherent dualisability
• Binary homomorphisms and natural dualities
• Natural dualities for quasivarieties generated by a finite commutative ring.
• Some remarks on dualisability and endodualisability
• Near unanimity: An obstacle to general duality theory
• Dualizability and graph algebras
• Dualisability. Unary algebras and beyond
• The Complexity of Dualisability: Three-Element Unary Algebras
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• UNCOUNTABLY MANY DUALISABLE ALGEBRAS
• Nilpotent groups are not dualizable
• EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
• Inherently Nonfinitely Based Solvable Algebras
• Strong duality for metacyclic groups
• Natural duality via a finite set of relations
• THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• Identities in Finite Algebras
• The dualisability of a quasi-variety is independent of the generating algebra.
• Full duality among graph algebras and flat graph algebras

This page was built for publication: Dualizability of automatic algebras.