Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Extensions to Barrington's M-program model
Theoretical Computer Science - Special issue on structure in complexity theory
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On Second-Order Monadic Groupoidal Quantifiers
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Characterizing definability of second-order generalized quantifiers
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
We consider the power of nondeterministic finite automata with generalized acceptance criteria and the corresponding logics. In particular, we examine the expressive power of monadic second-order logic enriched with monadic second-order generalized quantifiers for algebraic word-problems. Extending a well-known result by Büchi, Elgot, and Trakhtenbrot, we show that considering monoidal quantifiers, the obtained logic captures the class of regular languages. We also consider monadic second-order groupoidal quantifiers and show that these are powerful enough to define every language in LOGCFL.