Pages that link to "Item:Q2389351"
From MaRDI portal
The following pages link to The equality problem for infinite words generated by primitive morphisms (Q2389351):
Displaying 8 items.
- On the simplification of infinite morphic words (Q1006088) (← links)
- An algorithm for checking the equality of infinite catenations of finite languages (Q1281246) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- On the factors of automatic words (Q1392016) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Morphic words, Beatty sequences and integer images of the Fibonacci language (Q2290645) (← links)
- On the equivalence of the two existing extensions of the leximax criterion to the infinite case (Q2463575) (← links)
- On the subword equivalence problem for infinite words (Q4596614) (← links)