The equational complexity of Lyndon's algebra
From MaRDI portal
Publication:539978
DOI10.1007/s00012-011-0126-3zbMath1230.08002OpenAlexW2109782074MaRDI QIDQ539978
Marcel Jackson, George F. McNulty
Publication date: 1 June 2011
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-011-0126-3
polynomial time algorithmmembership problemsubdirectly irreducible algebraautomatic algebraequational complexitylogarithmic space algorithmLyndon algebrarelatively inherently nonfinitely based
Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05) Subdirect products and subdirect irreducibility (08B26)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonfinitely based pseudovarieties and inherently nonfinitely based varieties
- Lyndon's groupoid is not inherently nonfinitely based
- Lyndon's groupoid generates a small almost cross variety.
- The method of forced enumeration for nondeterministic automata
- On infinite subdirectly irreducible algebras in locally finite equational classes
- On pseudovarieties
- On bases of identities of finite inverse semigroups with solvable subgroups.
- Equational classes generated by finite algebras
- Dualisability. Unary algebras and beyond
- COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
- EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER
- EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
- Relatively inherently nonfinitely q-based semigroups
- Nondeterministic Space is Closed under Complementation
- Inherently Nonfinitely Based Solvable Algebras
- Direct multiplication of finite algebras does not preserve finite equational bases: two examples and a general statement
- THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
- THE MEMBERSHIP PROBLEM IN FINITE FLAT HYPERGRAPH ALGEBRAS
- Flat algebras and the translation of universal Horn logic to equational logic
- Identities in Finite Algebras
