Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Classifying regular languages by a split game
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
The Algebraic Counterpart of the Wagner Hierarchy
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Machines that can output empty words
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Polylog-time reductions decrease dot-depth
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Perfect correspondences between dot-depth and polynomial-time hierarchy
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
| Hi-index | 0.00 |