Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
10.1016/S0019-9958(72)90406-8 | ||||
The equation $a^M=b^Nc^P$ in a free group. | Michigan Mathematical Journal |
| 210 | 1962 |
10.1016/S0019-9958(72)90018-6 | ||||
8. NIVAT M., Éléments de la théorie générale des codes, Automata Theory, E. R.Caianiello éd., p.279-294, Academic Press, NewYork, 1966.2411680208.45101 | ||||
6. LOTHAIRE M., Combinatorics on Words, Reading, Massachussetts, Addison-Wesley, 1983.6759530514.20045 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Conjugacy relations of prefix codes | Theoretical Computer Science |
| 2016 | |
On effective construction of the greatest solution of language inequalityXA⊆BX | Theoretical Computer Science |
| 1 | 2014 |
Conjugacy of finite biprefix codes | Theoretical Computer Science |
| 3 | 2009 |
Simple equations on binary factorial languages | Theoretical Computer Science |
| 2009 | |
Playing with Conway’s problem | Theoretical Computer Science |
| 2008 |