The descriptive complexity approach to LOGCFL

  • Authors:

  • Clemens Lautemann;Pierre McKenzie;Thomas Schwentick;Heribert Vollmer

  • Affiliations:

  • Institut für Informatik, Johannes-Gutenberg-Universität Mainz, Mainz, Germany;Informatique et recherche opérationnelle, Université de Montréal, Montréal, Québec, Canada;Institut für Informatik, Johannes-Gutenberg-Universität Mainz, Mainz, Germany;Theoretische Informatik, Universität Würzburg, Würzburg, Germany

  • Venue:
  • STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Building upon the known generalized-quantifier-based firstorder characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC1 and its subclasses. In the absence of the BIT predicate, we resolve the main issues: we show in particular that no single outermost unary groupoidal quantifier with FO can capture all the context-free languages, and we obtain the surprising result that a variant of Greibach's "hardest contextfree language" is LOGCFL-complete under quantifier-free BIT-free interpretations. We then prove that FO with unary groupoidal quantifiers is strictly more expressive with the BIT predicate than without. Considering a particular groupoidal quantifier, we prove that first-order logic with majority of pairs is strictly more expressive than first-order with majority of individuals. As a technical tool of independent interest, we define the notion of an aperiodic nondeterministic finite automaton and prove that FO translations are precisely the mappings computed by single-valued aperiodic nondeterministic finite transducers.