 | 2011 |
|---|
| 12 |       | Wit Forys,
Piotr Oprocha:
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case.
Fundam. Inform. 111(2): 147-161 (2011) |
| 11 | | Wit Forys,
Janusz Matyja:
An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective.
J. Cellular Automata 6(2-3): 231-243 (2011) |
| 10 | | Wit Forys,
Juan Luis García Guirao,
Piotr Oprocha:
A dynamical model of parallel computation on bi-infinite time-scale.
J. Computational Applied Mathematics 235(7): 1826-1832 (2011) |
| 2010 |
|---|
| 9 | | Wit Forys,
Piotr Oprocha,
Slawomir Bakalarski:
Symbolic Dynamics, Flower Automata and Infinite Traces.
CIAA 2010: 135-142 |
| 2009 |
|---|
| 8 |  | Wit Forys,
Piotr Oprocha:
Pseudo-Random Walks On Graphs And Cryptography.
FCS 2009: 16-19 |
| 7 | | Wit Forys,
Piotr Oprocha:
Infinite Traces and Symbolic Dynamics.
Theory Comput. Syst. 45(1): 133-149 (2009) |
| 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page