Pages that link to "Item:Q685708"
From MaRDI portal
The following pages link to \(NC^ 1\): The automata-theoretic viewpoint (Q685708):
Displayed 10 items.
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)