Wit Forys

Publication Activity (10 Years)

Years Active: 1990-2016
Publications (10 Years): 1

Top Topics

Cellular Automaton

Top Venues

J. Cell. Autom.

Publications

Wit Forys, Janusz Matyja
On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points. J. Cell. Autom. 11 (5-6) (2016)
Wit Forys, Janusz Matyja
1. J. Cell. Autom. 9 (1) (2014)
Wit Forys, Janusz Matyja
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. Entropy 16 (11) (2014)
Wit Forys, Lukasz Jeda, Piotr Oprocha
On a Cipher Based on Pseudo-random Walks on Graphs. CSS (2014)
Wit Forys, Gabriel Semanisin, Magdalena Forys
Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs. ITAT (2013)
Wit Forys, Janusz Matyja
On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3). J. Cell. Autom. 8 (3-4) (2013)
Wit Forys, Janusz Matyja
3. J. Cell. Autom. 7 (4) (2012)
Wit Forys, Piotr Oprocha
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. Fundam. Informaticae 111 (2) (2011)
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. Cell. Autom. 6 (2-3) (2011)
Wit Forys, Juan Luis García Guirao, Piotr Oprocha
A dynamical model of parallel computation on bi-infinite time-scale. J. Comput. Appl. Math. 235 (7) (2011)
Wit Forys, Piotr Oprocha, Slawomir Bakalarski
Symbolic Dynamics, Flower Automata and Infinite Traces. CIAA (2010)
Wit Forys, Piotr Oprocha
Infinite Traces and Symbolic Dynamics. Theory Comput. Syst. 45 (1) (2009)
Wit Forys, Piotr Oprocha
Pseudo-Random Walks On Graphs And Cryptography. FCS (2009)
Adam Roman, Wit Forys
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. SOFSEM (2008)
Wit Forys
Retractions and retracts of free topological monoids. Int. J. Comput. Math. 83 (1) (2006)
Wit Forys, Tomasz Krawczyk
An algorithmic approach to the problem of a semiretract base. Theor. Comput. Sci. 369 (1-3) (2006)
Wit Forys
Asymptotic behaviour of bi-infinite words. RAIRO Theor. Informatics Appl. 38 (1) (2004)
Wit Forys, Tomasz Krawczyk, James A. Anderson
Semiretracts--a counterexample and some results. Theor. Comput. Sci. 307 (1) (2003)
Wit Forys
Some Characterization of Recursively Enumerable Sets. Int. J. Comput. Math. 79 (2) (2002)
Wit Forys
Fixed point generation of varieties of languages. Int. J. Comput. Math. 75 (2) (2000)
Wit Forys, Tom Head
The poset of retracts of a free monoid. Int. J. Comput. Math. 37 (1-2) (1990)