default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWit Forys
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j16]Wit Forys, Janusz Matyja:
On One-Sided, Topologically Mixing and Strongly Transitive CA with a Continuum of Period-Two Points. J. Cell. Autom. 11(5-6): 399-424 (2016)- 2014
- [j15]Wit Forys, 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 16(11): 5601-5617 (2014) - [j14]Wit Forys, Janusz Matyja:
On One-sided, Topologically Mixing Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log(n) for any Integer n > 1. J. Cell. Autom. 9(1): 37-58 (2014) - [c5]Wit Forys, Lukasz Jeda, Piotr Oprocha:
On a Cipher Based on Pseudo-random Walks on Graphs. CSS 2014: 59-73 - 2013
- [j13]Wit Forys, Janusz Matyja:
On One-Sided, D-Chaotic Cellular Automaton, Having Continuum of Fixed Points and Topological Entropy log(3). J. Cell. Autom. 8(3-4): 131-146 (2013) - [c4]Wit Forys, Gabriel Semanisin, Magdalena Forys:
Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs. ITAT 2013: 89-93 - 2012
- [j12]Wit Forys, Janusz Matyja:
On One-Sided, D-Chaotic Cellular Automata, Having Continuum of Fixed Points and Topological Entropy log (p) for any Prime p3. J. Cell. Autom. 7(4): 303-319 (2012) - 2011
- [j11]Wit Forys, Piotr Oprocha:
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. Fundam. Informaticae 111(2): 147-161 (2011) - [j10]Wit Forys, Janusz Matyja:
An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective. J. Cell. Autom. 6(2-3): 231-243 (2011) - [j9]Wit Forys, Juan Luis García Guirao, Piotr Oprocha:
A dynamical model of parallel computation on bi-infinite time-scale. J. Comput. Appl. Math. 235(7): 1826-1832 (2011) - 2010
- [c3]Wit Forys, Piotr Oprocha, Slawomir Bakalarski:
Symbolic Dynamics, Flower Automata and Infinite Traces. CIAA 2010: 135-142
2000 – 2009
- 2009
- [j8]Wit Forys, Piotr Oprocha:
Infinite Traces and Symbolic Dynamics. Theory Comput. Syst. 45(1): 133-149 (2009) - [c2]Wit Forys, Piotr Oprocha:
Pseudo-Random Walks On Graphs And Cryptography. FCS 2009: 16-19 - 2008
- [c1]Adam Roman, Wit Forys:
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. SOFSEM 2008: 448-459 - 2006
- [j7]Wit Forys:
Retractions and retracts of free topological monoids. Int. J. Comput. Math. 83(1): 21-26 (2006) - [j6]Wit Forys, Tomasz Krawczyk:
An algorithmic approach to the problem of a semiretract base. Theor. Comput. Sci. 369(1-3): 314-322 (2006) - 2004
- [j5]Wit Forys:
Asymptotic behaviour of bi-infinite words. RAIRO Theor. Informatics Appl. 38(1): 27-48 (2004) - 2003
- [j4]Wit Forys, Tomasz Krawczyk, James A. Anderson:
Semiretracts--a counterexample and some results. Theor. Comput. Sci. 307(1): 117-127 (2003) - 2002
- [j3]Wit Forys:
Some Characterization of Recursively Enumerable Sets. Int. J. Comput. Math. 79(2): 157-163 (2002) - 2000
- [j2]Wit Forys:
Fixed point generation of varieties of languages. Int. J. Comput. Math. 75(2): 137-141 (2000)
1990 – 1999
- 1990
- [j1]Wit Forys, Tom Head:
The poset of retracts of a free monoid. Int. J. Comput. Math. 37(1-2): 45-48 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
