Recommendations
- scientific article; zbMATH DE number 4033093
- Publication:4206411
- Group-Type Automata
- Extended finite automata over groups
- scientific article; zbMATH DE number 3903978
- scientific article; zbMATH DE number 3918681
- Representations of group automata
- Representation of automata by groups
- Finite automata over free groups
- scientific article; zbMATH DE number 3917722
Cites work
- scientific article; zbMATH DE number 3136688 (Why is no real title available?)
- scientific article; zbMATH DE number 3912645 (Why is no real title available?)
- scientific article; zbMATH DE number 3961008 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 4033093 (Why is no real title available?)
- scientific article; zbMATH DE number 4041299 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Bounded-depth, polynomial-size circuits for symmetric functions
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Classification of finite monoids: the language approach
- Constant Depth Reducibility
- Dot-depth of star-free events
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Finite monoids and the fine structure of NC 1
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- On finite monoids having only trivial subgroups
- Parity, circuits, and the polynomial-time hierarchy
- Superlinear lower bounds for bounded-width branching programs
- The NP-completeness column: An ongoing guide
- The dot-depth hierarchy of star-free languages is infinite
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(42)- An impossibility gap between width-4 and width-5 permutation branching programs
- On the computational power of programs over \(\mathsf{BA}_2\) monoid
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Finite semigroup varieties defined by programs
- \(NC^ 1\): The automata-theoretic viewpoint
- Lower bounds for modular counting by circuits with modular gates
- A topological approach to non-uniform complexity
- Complex polynomials and circuit lower bounds for modular counting
- scientific article; zbMATH DE number 4033093 (Why is no real title available?)
- Upper and lower bounds for some depth-3 circuit classes
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- Spectral properties of threshold functions
- New size hierarchies for two way automata
- Formulas, regular languages and Boolean circuits
- Languages defined with modular counting quantifiers
- Satisfiability in MultiValued Circuits
- Extensions to Barrington's M-program model
- scientific article; zbMATH DE number 7566068 (Why is no real title available?)
- Complexity of modular circuits
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
- Learning read-constant polynomials of constant degree modulo composites
- scientific article; zbMATH DE number 5697432 (Why is no real title available?)
- Representing Boolean functions as polynomials modulo composite numbers
- The power of programs over monoids in DA
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
- On the computational power of depth-2 circuits with threshold and modulo gates
- Ultrafilters on words for a fragment of logic
- The complexity of solving equations over finite groups
- Learning expressions and programs over monoids
- Regular languages in \(NC\)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and in sublinear size
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups
- A note on a theorem of Barrington, Straubing and Thérien
- MONOIDS AND COMPUTATIONS
- Programs over semigroups of dot-depth one
- Inapproximability results for equations over finite groups
- Circuit complexity before the dawn of the new millennium
- Nonuniform ACC circuit lower bounds
- A lower bound for depth-3 circuits with MOD \(m\) gates
- scientific article; zbMATH DE number 7250146 (Why is no real title available?)
- An Algebraic Perspective on Boolean Function Learning
This page was built for publication: Non-uniform automata over groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804303)
