Pages that link to "Item:Q1044983"
From MaRDI portal
The following pages link to Polynomial-time algorithm for fixed points of nontrivial morphisms (Q1044983):
Displaying 9 items.
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Weakly unambiguous morphisms (Q442106) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- Restricted ambiguity of erasing morphisms (Q551171) (← links)
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond (Q2164000) (← links)
- Ambiguity of Morphisms in a Free Group (Q3449361) (← links)
- Complexity of testing morphic primitivity (Q5298777) (← links)
- On Billaud words and their companions (Q5918681) (← links)
- On Billaud words and their companions (Q5925708) (← links)