scientific article; zbMATH DE number 7533328

DOI10.4230/LIPIcs.CSL.2018.3MaRDI QIDQ5079723

Peter Lindner, Unnamed Author, Dietrich Kuske

Publication date: 28 May 2022

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

zbMATH Keywords

model theorycomplexity theoryautomatic structures

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• The complexity of logical theories
• On direct products of automaton decidable theories
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• The computational complexity of logical theories
• The complexity of first-order and monadic second-order logic revisited
• Parametrized complexity theory.
• Three Lectures on Automatic Structures
• Automatic structures of bounded degree revisited
• The first order properties of products of algebraic systems
• An application of games to the completeness problem for formalized theories
• Automata Presenting Structures: A Survey of the Finite String Case
• Some natural decision problems in automatic graphs
• Unary automatic graphs: an algorithmic perspective
• Theories of Automatic Structures and Their Complexity
• Decision Problems of Finite Automata Design and Related Arithmetics
• STACS 2004

This page was built for publication: