Pages that link to "Item:Q1892890"

The following pages link to Regular languages defined with generalized quantifiers (Q1892890):

Displaying 20 items.

• Linear circuits, two-variable logic and weakly blocked monoids (Q391307) (← links)
• Counting modulo quantifiers on finite structures (Q1854352) (← links)
• Languages defined with modular counting quantifiers (Q1854424) (← links)
• Regular sets of infinite message sequence charts (Q1887140) (← links)
• Varieties (Q2074217) (← links)
• Codensity, profiniteness and algebras of semiring-valued measures (Q2318383) (← links)
• Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
• Expressive Completeness for LTL With Modulo Counting and Group Quantifiers (Q2825418) (← links)
• Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
• WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY (Q3561125) (← links)
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
• (Q4453869) (← links)
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY (Q4474460) (← links)
• Characterizing classes of regular languages using prefix codes of bounded synchronization delay (Q4588867) (← links)
• Quantifiers on languages and codensity monads (Q5006459) (← links)
• (Q5136301) (← links)
• One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
• Cascade Products and Temporal Logics on Finite Trees (Q5262961) (← links)
• Circuit complexity of regular languages (Q5918477) (← links)
• A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures (Q6612780) (← links)