Pages that link to "Item:Q1149429"
From MaRDI portal
The following pages link to The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429):
Displaying 4 items.
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (Q4923281) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
