Pages that link to "Item:Q5952903"
From MaRDI portal
The following pages link to On the expressibility of languages by word equations with a bounded number of variables (Q5952903):
Displaying 8 items.
- Unrestricted complementation in language equations over a one-letter alphabet (Q1334656) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- Two-variable word equations (Q2729626) (← links)
- The expressibility of languages and relations by word equations (Q4406307) (← links)
- (Q4737893) (← links)
- On the expressive power of three-valued and four-valued languages (Q4943507) (← links)
- ОБ УРАВНЕНИЯХ И НЕРАВЕНСТВАХ В СЛОВАХ И ДЛИНАХ (Q5239711) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)