dr hab. Wit Foryś

Jednostki:

Profesura  Otwarcie: 2011-05-26, Zamknięcie: 2012-10-25

Publikacje:

15.
Wit Foryś, 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 vol. 16 (2014), 5601-5617
14.
Wit Foryś, Łukasz Jęda, Piotr Oprocha
On a cipher based on pseudo-random walks on graphs vol. 448 (2014), "Cryptography and Security Systems, Series: Communications in Computer and Information Science", Springer
13.
Wit Foryś, Janusz Matyja
On One-sided, Topologically Mixing Cellular Automata, having Continuum of Fixed Points and Topological Entropy log(n) for any Integer n > 1, Journal of Cellular Automata vol. 9 (2014), 37-58
12.
Wit Foryś, Janusz Matyja
On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3), Journal of Cellular Automata vol. 8(3-4) (2013), 131-146
11.
Wit Foryś, Janusz Matyja
On one-sided, D-chaotic cellular automata, having continuum of fixed points and topological entropy log(p) for any prime p > 3, Journal of Cellular Automata vol. 4 (2012), 15
10.
Wit Foryś, Piotr Oprocha
Infinite traces and symbolic dynamics – minimal shift case, Fundamenta Informaticae vol. 111 (2011), 147 - 161
9.
Wit Foryś, Janusz Matyja
An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective, Journal of Cellular Automata vol. 6 (2011), 231 - 243
8.
Wit Foryś, J.L.Garcia Guirao, Piotr Oprocha
A dynamical model of parallel computation on bi-infinite time-scale, Journal of Computational and Applied Mathematics vol. 235 (2011), 1826 - 1832
7.
Sławomir Bakalarski, Wit Foryś, Piotr Oprocha
Symbolic Dynamics, Flower Automata and Infinite Traces, Lecture Notes in Computer Science vol. 6482 (2011), 135-142
6.
Wit Foryś, Piotr Oprocha
Infinite traces and symbolic dynamics, Theory of Computing Systems vol. 45 (2009), 133 - 149
5.
Wit Foryś
On a complete lattice of retracts of a free monoid generated by three elements, Opuscula Mathematica vol. 28 (2008), 123 - 128
4.
Wit Foryś, Adam Roman
Lower bound for the length of synchronizing words in partially-synchronizing automata, Lecture Notes in Computer Science vol. 4910 (2008), 448 - 459
3.
Wit Foryś, Tomasz Krawczyk
An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322
2.
Wit Foryś, Tomasz Krawczyk
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247
1.
Wit Foryś, Tomasz Krawczyk
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127

Konferencje:

2.
Wit Foryś, Sławomir Bakalarski.
15th Mons Theoretical Computer Science Days, Université de Lorraine, Nancy, Francja, 2014-09-23 - 2014-09-26
1.
Wit Foryś.
3 rd International Conference on Cryptography and Security Systems (CSS'14), Fac Math. Phys.Computer Sc. MCSUniv. Lublin, Lublin, Polska, 2014-09-22 - 2014-09-24

Doktoranci (po 27 października 2003 roku)

DoktorantOtwarcieZakonczenie
Tomasz Krawczyk2004-03-252005-09-22
Adam Roman2005-11-242006-10-26
Michał Kolarz2009-09-242012-03-29
Agnieszka Mielniczek (Deszyńska)2012-05-312016-05-19

Recenzje (po 27 października 2003 roku)

RecenzowanyJednostkaTreść recenzji
Doktorat: Iwona CieślikKatedra Algorytmiki