scientific article; zbMATH DE number 2112655
From MaRDI portal
Publication:4824214
zbMath1054.20015MaRDI QIDQ4824214
Publication date: 1 November 2004
Full work available at URL: https://eudml.org/doc/187936
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean algebrasfinite automatamonoidsfinitely generated nilpotent groupsrational subsetssolutions of equations
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Nilpotent groups (20F18) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (3)
On rationality of verbal subsets in a group ⋮ POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN ⋮ Closedness of a class of groups under free product
This page was built for publication: