Publication:4251062
zbMath0924.03069MaRDI QIDQ4251062
Pierre McKenzie, Heribert Vollmer, Clemens Lautemann, Thomas Schwentick
Publication date: 15 November 1999
context-free languages; aperiodic nondeterministic finite automaton; complexity classes; generalized quantifiers; FO; BIT predicate; \(NC^1\); first-order logic with majority of individuals; first-order logic with majority of pairs; groupoidal quantifiers; monoidal quantifiers; subclasses of LOGCFL
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03D15: Complexity of computation (including implicit computational complexity)
03C80: Logic with extra quantifiers and operators
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items