scientific article; zbMATH DE number 1744112

MaRDI QIDQ4529537zbMATH OpenFDO

Authors François Lemieux, Cristopher Moore, Denis Thérien

Publication date 18 September 2003

zbMATH Keywords

computational complexityfinite loopsfinite nilpotent groupsformal languagessubtree-counting loops

Mathematics Subject Classification ID

Loops, quasigroups (20N05) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 3912645
• scientific article; zbMATH DE number 4041299
• On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
• Finite loops recognize exactly the regular open languages
• Languages recognized by finite supersoluble groups

Cited in

(3)

• Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
• Hopf algebras in non-associative Lie theory
• Dimension filtration on loops.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529537)