scientific article; zbMATH DE number 4041299
From MaRDI portal
Publication:3779765
zbMATH Open0638.68073MaRDI QIDQ3779765FDOQ3779765
Authors: Pierre Péladeau, Denis Thérien
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- An Algebraic Perspective on Boolean Function Learning
- Programs over aperiodic monoids
- Title not available (Why is that?)
- Languages recognized by finite supersoluble groups
- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
- Languages and formations generated by \(D_4\) and \(Q_8\)
- Recognizing group languages with OBDDs
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- Learning read-constant polynomials of constant degree modulo composites
- Non-uniform automata over groups
- Extensions to Barrington's M-program model
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- The complexity of solving equations over finite groups
- The complexity of the equation solvability problem over nilpotent groups
- Title not available (Why is that?)
- An ergodic theorem for read-once non-uniform deterministic finite automata
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)