scientific article; zbMATH DE number 7559432
From MaRDI portal
Publication:5089232
DOI10.4230/LIPIcs.MFCS.2020.61MaRDI QIDQ5089232
Christian Schwarz, Dietrich Kuske
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)
Related Items (3)
The Subtrace Order and Counting First-Order Logic ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Existential Definability over the Subword Ordering
Cites Work
- Definability in the \(h\)-quasiorder of labeled forests
- Definability in substructure orderings. I: Finite semilattices
- The computational complexity of logical theories
- Languages ordered by the subword order
- On Boolean combinations forming piecewise testable languages
- Theories of orders on the set of words
- Definability in the Subword Order
- The Subtrace Order and Counting First-Order Logic
- Definability of Recursive Predicates in the Induced Subgraph Order
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
- Ordering by Divisibility in Abstract Algebras
- Well-structured transition systems everywhere!
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
