Complexity classes and theories of finite models

JF Lynch - Mathematical Systems Theory, 1981 - Springer
Abstract Let L ⊆ Σ* be accepted in time f (n) by a nondeterministic Turing machine. Then
there is a monadic existential second-order sentence σ in the language of+ such that for …
被引用次数：112 相关文章

[引用][C] COMPLEXITY CLASSES AND THEORIES OF FINITE MODELS

JF LYNCH - 1982 - pascal-francis.inist.fr
COMPLEXITY CLASSES AND THEORIES OF FINITE MODELS CNRS Inist Pascal-Francis
CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search …

[引用][C] Complexity classes and theories of finite models

JF Lynch - Theory of Computing Systems, 1981 - Springer