www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14309

Title: The Dynamic Complexity of Formal Languages
Authors: GELADE, Wouter
Marquardt, Marcel
Schwentick, Thomas
Issue Date: 2012
Publisher: ASSOC COMPUTING MACHINERY
Citation: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 13 (3)
Abstract: The article 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 are exactly 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.
Notes: [Gelade, Wouter] Hasselt Univ, Diepenbeek, Belgium. [Gelade, Wouter] Transnatl Univ Limburg, Limburg, Belgium. [Marquardt, Marcel; Schwentick, Thomas] Tech Univ Dortmund, Dortmund, Germany. thomas.schwentick@udo.edu
URI: http://hdl.handle.net/1942/14309
DOI: 10.1145/2287718.2287719
ISI #: 000308370100001
ISSN: 1529-3785
Category: A1
Type: Journal Contribution
Validation: ecoom, 2013
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
published version392.1 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.