Languages defined with modular counting quantifiers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1136081
- Definability of Languages by Generalized First-Order Formulas over (N,+)
- Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
- Regular languages defined with generalized quantifiers
- Circuit complexity and the expressive power of generalized first-order formulas
Cites work
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A logic for constant-depth circuits
- 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
- Finite monoids and the fine structure of NC 1
- Finite semigroup varieties defined by programs
- Languages that Capture Complexity Classes
- Non-uniform automata over groups
- On the computational power of depth 2 circuits with threshold and modulo gates
- Parity, circuits, and the polynomial-time hierarchy
- Regular languages defined with generalized quantifiers
- Regular languages in \(NC\)
- Superlinear lower bounds for bounded-width branching programs
- Weak Second‐Order Arithmetic and Finite Automata
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(13)- Sur le produit avec compteur modulo un nombre premier
- Indexed counter languages
- scientific article; zbMATH DE number 7577578 (Why is no real title available?)
- Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
- Difference hierarchies and duality with an application to formal languages
- Counting modulo quantifiers on finite structures
- Definability of Languages by Generalized First-Order Formulas over (N,+)
- A note on some languages in uniform \(ACC^ 0\)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- The regular languages of first-order logic with one alternation
- On languages in countably generated semilattices
- Quantitative Languages Defined by Functional Automata
- Modular quantifiers
This page was built for publication: Languages defined with modular counting quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854424)