| 2009 | ||
|---|---|---|
| 7 | Wit Forys, Piotr Oprocha: Pseudo-Random Walks On Graphs And Cryptography. FCS 2009: 16-19 | |
| 2008 | ||
| 6 | Adam Roman, Wit Forys: Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. SOFSEM 2008: 448-459 | |
| 2006 | ||
| 5 | Wit Forys: Retractions and retracts of free topological monoids. Int. J. Comput. Math. 83(1): 21-26 (2006) | |
| 4 | Wit Forys, Tomasz Krawczyk: An algorithmic approach to the problem of a semiretract base. Theor. Comput. Sci. 369(1-3): 314-322 (2006) | |
| 2004 | ||
| 3 | Wit Forys: Asymptotic behaviour of bi-infinite words. ITA 38(1): 27-48 (2004) | |
| 2003 | ||
| 2 | Wit Forys, Tomasz Krawczyk, James A. Anderson: Semiretracts--a counterexample and some results. Theor. Comput. Sci. 307(1): 117-127 (2003) | |
| 2002 | ||
| 1 | Wit Forys: Some Characterization of Recursively Enumerable Sets. Int. J. Comput. Math. 79(2): 157-163 (2002) | |
| 1 | James A. Anderson | [2] |
| 2 | Tomasz Krawczyk | [2] [4] |
| 3 | Piotr Oprocha | [7] |
| 4 | Adam Roman | [6] |