Wit Forys

发表

On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points

Wit Forys, Janusz Matyja, 2016, J. Cell. Autom..

On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3)

Wit Forys, Janusz Matyja, 2013, J. Cell. Autom..

Pseudo-Random Walks On Graphs And Cryptography

Wit Forys, Piotr Oprocha, 2009, FCS.

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, 2014, J. Cell. Autom..

A dynamical model of parallel computation on bi-infinite time-scale

Juan Luis García Guirao, Wit Forys, Piotr Oprocha, 2011, J. Comput. Appl. Math..

The poset of retracts of a free monoid

Wit Forys, Tom Head, 1990, Int. J. Comput. Math..

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, 2012, J. Cell. Autom..

An algorithmic approach to the problem of a semiretract base

Wit Forys, Tomasz Krawczyk, 2006, Theor. Comput. Sci..

Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata

Adam Roman, Wit Forys, A. Roman, 2008, SOFSEM.

Asymptotic behaviour of bi-infinite words

Wit Forys, 2004, RAIRO Theor. Informatics Appl..

On a Cipher Based on Pseudo-random Walks on Graphs

Wit Forys, Piotr Oprocha, Lukasz Jeda, 2014, CSS.

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case

Wit Forys, Piotr Oprocha, P. Oprocha, 2011, Fundam. Informaticae.

Symbolic Dynamics, Flower Automata and Infinite Traces

Wit Forys, Piotr Oprocha, Slawomir Bakalarski, 2010, CIAA.

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, 2014, Entropy.

Some Characterization of Recursively Enumerable Sets

Wit Forys, 2002, Int. J. Comput. Math..

Semiretracts--a counterexample and some results

James A. Anderson, Wit Forys, Tomasz Krawczyk, 2003, Theor. Comput. Sci..

Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs

Wit Forys, Magdalena Forys, Gabriel Semanisin, 2013, ITAT.

An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective

Wit Forys, Janusz Matyja, 2011, J. Cell. Autom..

Retractions and retracts of free topological monoids

Wit Forys, 2006, Int. J. Comput. Math..

Infinite Traces and Symbolic Dynamics

Wit Forys, Piotr Oprocha, P. Oprocha, 2009, Theory of Computing Systems.