The height of piecewise-testable languages and the complexity of the logic of subwords - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2019

The height of piecewise-testable languages and the complexity of the logic of subwords

Fichier non déposé

Dates et versions

hal-02408723 , version 1 (13-12-2019)

Identifiants

  • HAL Id : hal-02408723 , version 1

Citer

Philippe Schnoebelen, Prateek Karandikar. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Computer Science, 2019. ⟨hal-02408723⟩
26 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More