scientific article; zbMATH DE number 7533328
From MaRDI portal
Publication:5079723
DOI10.4230/LIPICS.CSL.2018.3MaRDI QIDQ5079723FDOQ5079723
Peter Lindner, Author name not available (Why is that?), Dietrich Kuske
Publication date: 28 May 2022
Title of this publication is not available (Why is that?)
Cites Work
- On direct products of automaton decidable theories
- Parametrized complexity theory.
- Three Lectures on Automatic Structures
- Automata Presenting Structures: A Survey of the Finite String Case
- STACS 2004
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- An application of games to the completeness problem for formalized theories
- Decision Problems of Finite Automata Design and Related Arithmetics
- The complexity of first-order and monadic second-order logic revisited
- The complexity of logical theories
- The first order properties of products of algebraic systems
- Synchronized rational relations of finite and infinite words
- The computational complexity of logical theories
- Automatic structures of bounded degree revisited
- Unary automatic graphs: an algorithmic perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some natural decision problems in automatic graphs
- Theories of Automatic Structures and Their Complexity
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079723)
