Computer Science – Computational Complexity
Scientific paper
1998-09-28
Computer Science
Computational Complexity
10 pages, 1 figure
Scientific paper
Building upon the known generalized-quantifier-based first-order 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 context-free language'' is LOGCFL-complete under quantifier-free BIT-free projections. 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.
Lautemann Clemens
McKenzie Pierre
Schwentick Thomas
Vollmer Heribert
No associations
LandOfFree
The descriptive complexity approach to LOGCFL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The descriptive complexity approach to LOGCFL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The descriptive complexity approach to LOGCFL will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-481990