Modulo counting on words and trees
From MaRDI portal
Recommendations
Cites work
- Answering FO+MOD queries under updates on bounded degree databases
- Complexity of two-variable logic on finite trees
- Counting modulo quantifiers on finite structures
- Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
- Domino-tiling games
- Expressive completeness for LTL with modulo counting and group quantifiers
- Extending two-variable logic on trees
- First-order logic with two variables and unary temporal logic
- Hanf normal form for first-order logic with unary counting quantifiers
- Modular quantifiers
- Modulo-counting quantifiers over finite trees
- Non-definability of Languages by Generalized First-order Formulas over (N,+)
- On the complexity of the two-variable guarded fragment with transitive guards
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Regular languages defined with generalized quantifiers
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
- Two-variable first order logic with counting quantifiers: complexity results
- Two-variable logic with counting and a linear order
Cited in
(3)
This page was built for publication: Modulo counting on words and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136301)
