scientific article

zbMath0638.68073MaRDI QIDQ3779765

Pierre Péladeau, Denis Thérien

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

nilpotent grouprecognizing by finite automata

Mathematics Subject Classification ID

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

Related Items (9)

The complexity of the equation solvability problem over nilpotent groups ⋮ The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning read-constant polynomials of constant degree modulo composites ⋮ Extensions to Barrington's M-program model ⋮ An Algebraic Perspective on Boolean Function Learning ⋮ An ergodic theorem for read-once non-uniform deterministic finite automata ⋮ The complexity of solving equations over finite groups ⋮ Non-uniform automata over groups

This page was built for publication: