scientific article; zbMATH DE number 6257031
From MaRDI portal
Publication:5747087
zbMath1359.68155MaRDI QIDQ5747087
Franz Baader, Alexander Okhotin
Publication date: 11 February 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On the expressive power of univariate equations over sets of natural numbers ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ ⋮ Language equations
This page was built for publication:
