scientific article; zbMATH DE number 2079028

zbMath1044.68631MaRDI QIDQ4474840

Clemens Lautemann, Denis Thérien, Thomas Schwentick

Publication date: 21 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items

Closure properties of locally finite \(\omega\)-languages ⋮ A descriptive characterisation of linear languages ⋮ First-Order Logic Definability of Free Languages ⋮ On winning Ehrenfeucht games and monadic NP ⋮ Enumerating grammar-based extractions ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Weighted Logics for Nested Words and Algebraic Formal Power Series ⋮ Aural pattern recognition experiments and the subregular hierarchy ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ Operator precedence temporal logic and model checking ⋮ Unnamed Item ⋮ The dark side of interval temporal logic: marking the undecidability border ⋮ Monadic Second-Order Logic and Transitive Closure Logics over Trees ⋮ The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey ⋮ Locally finite languages ⋮ The descriptive complexity approach to LOGCFL ⋮ Weighted automata with storage ⋮ Unnamed Item ⋮ Weighted operator precedence languages ⋮ Logic for \(\omega\)-pushdown automata ⋮ Weighted Operator Precedence Languages