The poset of retracts of a free monoid. - Wit Forys; Tom Head (Int. J. Comput. Math., 1990)

Fixed point generation of varieties of languages. - Wit Forys (Int. J. Comput. Math., 2000)

Some Characterization of Recursively Enumerable Sets. - Wit Forys (Int. J. Comput. Math., 2002)

Semiretracts–a counterexample and some results. - Wit Forys; Tomasz Krawczyk; James A. Anderson (Theor. Comput. Sci., 2003)

Asymptotic behaviour of bi-infinite words. - Wit Forys (RAIRO Theor. Informatics Appl., 2004)

Retractions and retracts of free topological monoids. - Wit Forys (Int. J. Comput. Math., 2006)

An algorithmic approach to the problem of a semiretract base. - Wit Forys; Tomasz Krawczyk (Theor. Comput. Sci., 2006)

Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. - Adam Roman; Wit Forys (SOFSEM, 2008)

Pseudo-Random Walks On Graphs And Cryptography. - Wit Forys; Piotr Oprocha (FCS, 2009)

Infinite Traces and Symbolic Dynamics. - Wit Forys; Piotr Oprocha (Theory Comput. Syst., 2009)

Symbolic Dynamics, Flower Automata and Infinite Traces. - Wit Forys; Piotr Oprocha; Slawomir Bakalarski (CIAA, 2010)

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. - Wit Forys; Piotr Oprocha (Fundam. Informaticae, 2011)

An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective. - Wit Forys; Janusz Matyja (J. Cell. Autom., 2011)

A dynamical model of parallel computation on bi-infinite time-scale. - Wit Forys; Juan Luis García Guirao; Piotr Oprocha (J. Comput. Appl. Math., 2011)

On One-Sided, D-Chaotic Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log (p) for any Prime p3. - Wit Forys; Janusz Matyja (J. Cell. Autom., 2012)

Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs. - Wit Forys; Gabriel Semanisin; Magdalena Forys (ITAT, 2013)

On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3). - Wit Forys; Janusz Matyja (J. Cell. Autom., 2013)

On a Cipher Based on Pseudo-random Walks on Graphs. - Wit Forys; Lukasz Jeda; Piotr Oprocha (CSS, 2014)

On One-Sided, D-Chaotic CA Without Fixed Points, Having Continuum of Periodic Points With Period 2 and Topological Entropy log(p) for Any Prime p. - Wit Forys; Janusz Matyja (Entropy, 2014)

On One-sided, Topologically Mixing Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log(n) for any Integer n > 1. - Wit Forys; Janusz Matyja (J. Cell. Autom., 2014)

On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points. - Wit Forys; Janusz Matyja (J. Cell. Autom., 2016)