Complexity of counting first-order logic for the subword order
From MaRDI portal
Publication:5089232
DOI10.4230/LIPICS.MFCS.2020.61MaRDI QIDQ5089232FDOQ5089232
Authors: Dietrich Kuske, Christian Schwarz
Publication date: 18 July 2022
Recommendations
Formal languages and automata (68Q45) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)
Cites Work
- Definability in substructure orderings. I: Finite semilattices
- Definability of Recursive Predicates in the Induced Subgraph Order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Ordering by Divisibility in Abstract Algebras
- The computational complexity of logical theories
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
- Theories of orders on the set of words
- Definability in the \(h\)-quasiorder of labeled forests
- Title not available (Why is that?)
- Definability in the Subword Order
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Boolean combinations forming piecewise testable languages
- Title not available (Why is that?)
- Languages ordered by the subword order
- Title not available (Why is that?)
- The Subtrace Order and Counting First-Order Logic
Cited In (5)
This page was built for publication: Complexity of counting first-order logic for the subword order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089232)