Pages that link to "Item:Q1249437"
From MaRDI portal
The following pages link to The ultimate equivalence problem for DOL systems (Q1249437):
Displayed 8 items.
- On some decidability problems for HDOL systems with nonsingular Parikh matrices (Q599513) (← links)
- On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
- On infinite words obtained by iterating morphisms (Q1168084) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- (Q3334093) (← links)
- On the periodicity of morphisms on free monoids (Q3747748) (← links)
- A homomorphic characterization of time and space complexity classes of languages† (Q3888530) (← links)
- Homomorphism equivalence on etol languages† (Q4185823) (← links)