Pages that link to "Item:Q3769989"
From MaRDI portal
The following pages link to The ω sequence problem for DOL systems is decidable (Q3769989):
Displayed 12 items.
- On D0L systems with immigration (Q1314370) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- The equality problem for infinite words generated by primitive morphisms (Q2389351) (← links)
- DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES (Q2841990) (← links)
- REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM (Q3021985) (← links)
- THE D0L ω-EQUIVALENCE PROBLEM (Q3426793) (← links)
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES (Q3646174) (← links)
- On infinite HD0L words having sparse letters (Q4464260) (← links)
- Decidability of periodicity for infinite words (Q4727446) (← links)
- A bound for the<i>ω</i>-equivalence problem of polynomial D0L systems (Q4825477) (← links)
- Iterative devices generating infinite words (Q5096808) (← links)
- On infinite words generated by polynomial D0L systems (Q5957360) (← links)