Linear circuits, two-variable logic and weakly blocked monoids
From MaRDI portal
Recommendations
- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
- scientific article; zbMATH DE number 3871197
- scientific article; zbMATH DE number 3959282
- scientific article; zbMATH DE number 512861
- scientific article; zbMATH DE number 988809
- Bistructures, bidomains and linear logic
- Circuits and Expressions over Finite Semirings
- Finite Monoids: From Word to Circuit Evaluation
- Arithmetic Circuits, Monomial Algebras and Finite Automata
- Two-Variable Logic over Countable Linear Orderings
Cites work
- scientific article; zbMATH DE number 2086221 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1775408 (Why is no real title available?)
- Automata, Languages and Programming
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Characterizing \(\text{TC}^{0}\) in terms of infinite groups
- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
- On finite monoids having only trivial subgroups
- On uniformity within \(NC^ 1\)
- Parity, circuits, and the polynomial-time hierarchy
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
- Regular languages defined with generalized quantifiers
- Typed monoids -- an Eilenberg-like theorem for non regular languages
Cited in
(3)
This page was built for publication: Linear circuits, two-variable logic and weakly blocked monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391307)
