The dynamic complexity of formal languages
From MaRDI portal
Publication:2946668
DOI10.1145/2287718.2287719zbMath1351.68108OpenAlexW2024823088MaRDI QIDQ2946668
Thomas Schwentick, Marcel Marquardt, Wouter Gelade
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1829/
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Related Items (8)
Dynamic conjunctive queries ⋮ The dynamic descriptive complexity of \(k\)-clique ⋮ The dynamic complexity of acyclic hypergraph homomorphisms ⋮ Dynamic Complexity of the Dyck Reachability ⋮ Unnamed Item ⋮ Work-sensitive dynamic complexity of formal languages ⋮ On the quantifier-free dynamic complexity of reachability ⋮ Unnamed Item
This page was built for publication: The dynamic complexity of formal languages
