Get started
Author

Wit Foryś

Observed names: Foryś, Wit, Wit Forys
OpenAlex ID: A5024712618
The poset of retracts of a free monoid
1990 · Wit Foryś, Tom Head · International Journal of Computer Mathematics · 8
Infinite Traces and Symbolic Dynamics
2007 · Wit Foryś, Piotr Oprocha · Theory of Computing Systems · 7
Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies
1991 · Wit Foryś, Tom Head · Semigroup Forum · 6
On the family of retracts of free monoids
1990 · Wit Forys · International Journal of Computer Mathematics · 4
A dynamical model of parallel computation on bi-infinite time-scale
2009 · Wit Foryś, Juan Luis García Guirao, et al. · Journal of Computational and Applied Mathematics · 3
PDF
Fixed point languages of rational transductions
1986 · Wit Foryś · Semigroup Forum · 3
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
2011 · Wit Foryś, Piotr Oprocha · Fundamenta Informaticae · 2
On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3).
2013 · Wit Foryś, Janusz Matyja · Jagiellonian University Repository (Jagiellonian University) · 1
On One-Sided, D-Chaotic Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log ( p ) for any Prime p 3.
2012 · Wit Foryś, Janusz Matyja · Jagiellonian University Repository (Jagiellonian University) · 1
Symbolic Dynamics, Flower Automata and Infinite Traces
2011 · Wit Foryś, Piotr Oprocha, et al. · Lecture notes in computer science · 1
An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective.
2011 · Wit Foryś, Janusz Matyja · Jagiellonian University Repository (Jagiellonian University) · 1
Pseudo-Random Walks On Graphs And Cryptography.
2009 · Wit Foryś, Piotr Oprocha · FCS · 1
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
2008 · Adam Roman, Wit Foryś · Springer eBooks · 1
An algorithmic approach to the problem of a semiretract base
2006 · Wit Foryś, Tomasz Krawczyk · Theoretical Computer Science · 1
PDF
Asymptotic behaviour of bi-infinite words
2004 · Wit Foryś · RAIRO - Theoretical Informatics and Applications · 1
PDF
Semiretracts—a counterexample and some results
2003 · Wit Foryś, Tomasz Krawczyk, et al. · Theoretical Computer Science · 1
On equality sets of morphisms in topological free monoids
1991 · Wit Foryś · RAIRO - Theoretical Informatics and Applications · 1
PDF
A fixed point characterization of cofinite languages
1984 · Wit Foryś · Semigroup Forum · 1
On Some Cryptographic Protocol
2021 · Wit Foryś · Schedae Informaticae
PDF
On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points.
2016 · Wit Foryś, Janusz Matyja · Journal of cellular automata
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
2014 · Wit Forys, Janusz Matyja · Entropy
PDF
On a Cipher Based on Pseudo-random Walks on Graphs
2014 · Wit Foryś, Łukasz Jęda, et al. · Communications in computer and information science
On One-sided, Topologically Mixing Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log(n) for any Integer n > 1.
2014 · Wit Foryś, Janusz Matyja · Journal of cellular automata
On one-sided, topologically mixing cellular automata, having continuum of fixed points and topological entropy log(n) for any integer $\mathit{n}> 1$
2014 · Foryś, Wit, Matyja, Janusz · Jagiellonian University Repository (Jagiellonian University)
Trace shifts - minimal case for independence relations given by five node co-graphs
2013 · Wit Foryś, Gabriel Semanišin, et al. · ITAT
Works count: 32
Citation count: 44
H-index: 4
I10-index:
Year
Topic
Type