Janusz Matyja

According to our database, Janusz Matyja authored at least 11 papers between 2001 and 2021.

Collaborative distances:

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

2021

Ergodic Properties of Certain Strongly Transitive CA with a Continuum of Two-Periodic Points.

Janusz Matyja

J. Cell. Autom., 2021

2019

Extensions of One-Sided Surjective CA with Certain Measure-Theoretic Properties.

Janusz Matyja

J. Cell. Autom., 2019

Topological and Measure-Theoretic Properties of Certain Open, Topologically Mixing and Strongly Transitive CA.

Janusz Matyja

J. Cell. Autom., 2019

2018

Extensions of Certain Transitive CA with Finite Sets of <i>m</i>-periodic Points.

Janusz Matyja

J. Cell. Autom., 2018

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

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

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

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

2001

Sets of primitive words given by fixed points of mappings.

Janusz Matyja

Int. J. Comput. Math., 2001