Functions computable in polynomial space
Information and Computation
Functions computable in polynomial space
Information and Computation
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
In the past few years, generalized operators (a. k. a. leaf languages) in the context of polynomial-time machines, and gates computing arbitrary groupoidal functions in the context of Boolean circuits, have raised much interest. We survey results from both areas, point out connections between them, and present relationships to a generalized quantifier concept from finite model theory.