The following pages link to (Q5747087):
Displaying 6 items.
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Unrestricted complementation in language equations over a one-letter alphabet (Q1334656) (← links)
- Language equations (Q2074222) (← links)
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ (Q2835862) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
- On the expressibility of languages by word equations with a bounded number of variables (Q5952903) (← links)