Wit Forys

According to our database, Wit Forys authored at least 21 papers between 1990 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

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

Wit Forys, Janusz Matyja

J. Cell. Autom., 2016

2014

On One-sided, Topologically Mixing Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log(n) for any Integer <i>n</i> > 1.

Wit Forys, Janusz Matyja

J. Cell. Autom., 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 a Cipher Based on Pseudo-random Walks on Graphs.

Wit Forys, Lukasz Jeda, Piotr Oprocha

Proceedings of the Cryptography and Security Systems - Third International Conference, 2014

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

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

Wit Forys, Gabriel Semanisin, Magdalena Forys

Proceedings of the Conference on Information Technologies, 2013

2012

On One-Sided, D-Chaotic Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log (<i>p</i>) for any Prime <i>p</i>3.

Wit Forys, Janusz Matyja

J. Cell. Autom., 2012

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

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

Infinite Traces and Symbolic Dynamics - the Minimal Shift Case.

Wit Forys, Piotr Oprocha

Fundam. Informaticae, 2011

2010

Symbolic Dynamics, Flower Automata and Infinite Traces.

Wit Forys, Piotr Oprocha, Slawomir Bakalarski

Proceedings of the Implementation and Application of Automata, 2010

2009

Infinite Traces and Symbolic Dynamics.

Wit Forys, Piotr Oprocha

Theory Comput. Syst., 2009

Pseudo-Random Walks On Graphs And Cryptography.

Wit Forys, Piotr Oprocha

Proceedings of the 2009 International Conference on Foundations of Computer Science, 2009

2008

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

Adam Roman, Wit Forys

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2006

An algorithmic approach to the problem of a semiretract base.

Wit Forys, Tomasz Krawczyk

Theor. Comput. Sci., 2006

Retractions and retracts of free topological monoids.

Wit Forys

Int. J. Comput. Math., 2006

2004

Asymptotic behaviour of bi-infinite words.

Wit Forys

RAIRO Theor. Informatics Appl., 2004

2003

Semiretracts--a counterexample and some results.

Wit Forys, Tomasz Krawczyk, James A. Anderson

Theor. Comput. Sci., 2003

2002

Some Characterization of Recursively Enumerable Sets.

Wit Forys

Int. J. Comput. Math., 2002

2000

Fixed point generation of varieties of languages.

Wit Forys

Int. J. Comput. Math., 2000

1990

The poset of retracts of a free monoid.

Wit Forys, Tom Head

Int. J. Comput. Math., 1990