Definability with bounded number of bound variables
Information and Computation
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regular languages defined with generalized quantifiers
Information and Computation
Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Varieties Of Formal Languages
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
First-Order Logic with Two Variables and Unary Temporal
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Weakly Iterated Block Products of Finite Monoids
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Linear circuits, two-variable logic and weakly blocked monoids
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We give an algebraic characterization of the regular languages defined by sentences with both modular and first-order quantifiers that use only two variables.