scientific article; zbMATH DE number 4041299

zbMATH Open0638.68073MaRDI QIDQ3779765FDOQ3779765

Authors Pierre Péladeau, Denis Thérien

Publication date 1988

zbMATH Keywords

nilpotent grouprecognizing by finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 3912645
• Programs over aperiodic monoids
• scientific article; zbMATH DE number 1150244
• scientific article; zbMATH DE number 1047940
• scientific article; zbMATH DE number 4033093

Cited in

(16)

• An ergodic theorem for read-once non-uniform deterministic finite automata
• Programs over aperiodic monoids
• Languages and formations generated by \(D_4\) and \(Q_8\)
• Languages recognized by finite supersoluble groups
• scientific article; zbMATH DE number 4033093 (Why is no real title available?)
• Extensions to Barrington's M-program model
• scientific article; zbMATH DE number 1744112 (Why is no real title available?)
• Learning read-constant polynomials of constant degree modulo composites
• Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
• Non-uniform automata over groups
• Recognizing group languages with OBDDs
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of solving equations over finite groups
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• An Algebraic Perspective on Boolean Function Learning

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 Q3779765)