The following pages link to Regular languages in \(NC\) (Q1191027):
Displaying 45 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- Varieties (Q2074217) (← links)
- The regular languages of wire linear \(\mathrm{AC}^0\) (Q2170278) (← links)
- Difference hierarchies and duality with an application to formal languages (Q2310785) (← links)
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. (Q2490810) (← links)
- The many faces of a translation (Q2581761) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Cost Register Automata for Nested Words (Q2817901) (← links)
- A Circuit Complexity Approach to Transductions (Q2946331) (← links)
- Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (Q2946409) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- Visibly counter languages and constant depth circuits (Q2955026) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- On Distinguishing NC $$^1$$ and NL (Q3451114) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- (Q4298445) (← links)
- (Q4453869) (← links)
- (Q4453870) (← links)
- Threshold Circuits for Iterated Matrix Product and Powering (Q4494480) (← links)
- Some results on<i>C</i>-varieties (Q4680738) (← links)
- EQUATIONAL DESCRIPTIONS OF LANGUAGES (Q4923277) (← links)
- On All Things Star-Free (Q5092328) (← links)
- (Q5101347) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
- Dual Space of a Lattice as the Completion of a Pervin Space (Q5283200) (← links)
- (Q5376662) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- Circuit complexity of regular languages (Q5918477) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)
- Substitution Principle and semidirect products (Q6190406) (← links)
- The amazing mixed polynomial closure and its applications to two-variable first-order logic (Q6649443) (← links)
- The regular languages of first-order logic with one alternation (Q6649495) (← links)
