Regular Languages Definable by Majority Quantifiers with Two Variables
From MaRDI portal
Recommendations
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
- Regular languages defined with generalized quantifiers
- scientific article; zbMATH DE number 4076666
- scientific article; zbMATH DE number 2051828
- Two-variable first order logic with modular predicates over words
Cites work
- Amplifying lower bounds by means of self-reducibility
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1916674 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
- Logic Meets Algebra: the Case of Regular Languages
- Nesting until and since in linear temporal logic
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Cited in
(5)- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
- Regular languages defined with generalized quantifiers
- ``Most of leads to undecidability: failure of adding frequencies to LTL
- A language-theoretical approach to descriptive complexity
- Separating regular languages with two quantifier alternations
This page was built for publication: Regular Languages Definable by Majority Quantifiers with Two Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637216)
