Wit Forys

21 papers B 1C 1Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2016 J jnl
On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points.
J. Cell. Autom.
Wit Forys, Janusz Matyja
2014 J jnl
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
Wit Forys, Janusz Matyja
2014 J jnl
On One-sided, Topologically Mixing Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log(n) for any Integer
J. Cell. Autom.
Wit Forys, Janusz Matyja
2014 — conf
On a Cipher Based on Pseudo-random Walks on Graphs.
CSS
Wit Forys, Lukasz Jeda, Piotr Oprocha
2013 J jnl
On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3).
J. Cell. Autom.
Wit Forys, Janusz Matyja
2013 — conf
Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs.
ITAT
Wit Forys, Gabriel Semanisin, Magdalena Forys
2012 J jnl
On One-Sided, D-Chaotic Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log (
J. Cell. Autom.
Wit Forys, Janusz Matyja
2011 J jnl
A dynamical model of parallel computation on bi-infinite time-scale.
J. Comput. Appl. Math.
Wit Forys, Juan Luis García Guirao, Piotr Oprocha
2011 J jnl
An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective.
J. Cell. Autom.
Wit Forys, Janusz Matyja
2011 J jnl
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case.
Fundam. Informaticae
Wit Forys, Piotr Oprocha
2010 C conf
Symbolic Dynamics, Flower Automata and Infinite Traces.
CIAA
Wit Forys, Piotr Oprocha, Slawomir Bakalarski
2009 J jnl
Infinite Traces and Symbolic Dynamics.
Theory Comput. Syst.
Wit Forys, Piotr Oprocha
2009 — conf
Pseudo-Random Walks On Graphs And Cryptography.
FCS
Wit Forys, Piotr Oprocha
2008 B conf
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata.
SOFSEM
Adam Roman, Wit Forys
2006 J jnl
An algorithmic approach to the problem of a semiretract base.
Theor. Comput. Sci.
Wit Forys, Tomasz Krawczyk
2006 J jnl
Retractions and retracts of free topological monoids.
Int. J. Comput. Math.
Wit Forys
2004 J jnl
Asymptotic behaviour of bi-infinite words.
RAIRO Theor. Informatics Appl.
Wit Forys
2003 J jnl
Semiretracts--a counterexample and some results.
Theor. Comput. Sci.
Wit Forys, Tomasz Krawczyk, James A. Anderson
2002 J jnl
Some Characterization of Recursively Enumerable Sets.
Int. J. Comput. Math.
Wit Forys
2000 J jnl
Fixed point generation of varieties of languages.
Int. J. Comput. Math.
Wit Forys
1990 J jnl
The poset of retracts of a free monoid.
Int. J. Comput. Math.
Wit Forys, Tom Head