Note: a descriptive complexity approach to the linear hierarchy

Authors:
Yassine Hachaïchi
Affiliations:
IPEI-El Manar, B.P. 244, 2092 El Manar, Tunisia
Venue:
Theoretical Computer Science
Year:
2003

Citing 6
Cited 1

Languages that capture complexity classes

SIAM Journal on Computing
Nearly linear time

Logic at Botik'89 Symposium on logical foundations of computer science
Languages, automata, and logic

Handbook of formal languages, vol. 3
Monadic Logical Definability of NP-Complete Problems

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Sub-elementary classes of functions and relations.

Sub-elementary classes of functions and relations.
A logical characterisation of linear time on nondeterministic turing machines

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Fragments of Monadic Second-Order Logics Over Word Structures

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper gives some new logical characterizations of the class of rudimentary languages in the scope of descriptive complexity. These characterizations are based on a logic introduced by Parigot and Pelz to characterize Petri Net languages, and generalized quantifiers of comparison of cardinality.