Pages that link to "Item:Q845664"
From MaRDI portal
The following pages link to Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664):
Displaying 4 items.
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- Preface (Q5900158) (← links)
