The Dynamic complexity of formal languages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

The Dynamic complexity of formal languages

Résumé

The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary functions, respectively. It is shown that the languages maintainable in DynPROP exactly are the regular languages, even when allowing arbitrary precomputation. This enables lower bounds for DynPROP and separates DynPROP from DynQF and DynFO. Further, it is shown that any context-free language can be maintained in DynFO and a number of specific context-free languages, for example all Dyck-languages, are maintainable in DynQF. Furthermore, the dynamic complexity of regular tree languages is investigated and some results concerning arbitrary structures are obtained: there exist first-order definable properties which are not maintainable in DynPROP. On the other hand any existential first-order property can be maintained in DynQF when allowing precomputation.
Fichier principal
Vignette du fichier
40-gelade.pdf (242.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00359755 , version 1 (09-02-2009)

Identifiants

  • HAL Id : inria-00359755 , version 1

Citer

Wouter Gelade, Marcel Marquardt, Thomas Schwentick. The Dynamic complexity of formal languages. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.481-492. ⟨inria-00359755⟩

Collections

STACS2009
78 Consultations
280 Téléchargements

Partager

Gmail Facebook X LinkedIn More