2 problems
- 0 votes0 replies0 views
The mixed-alphabet language conjecture for smooth words
Let be a mixed binary alphabet, let be the set of infinite smooth words over , let be the set of fini…
- 0 votes0 replies1 view
Dekking–Sing language conjecture for smooth words
Let be a binary alphabet, let be the set of infinite smooth words over , let be the set of finite f-s…