| Publication | Date of Publication | Type |
|---|
| Dynamical properties of certain open, topologically mixing and strongly transitive CA | 2021-08-25 | Paper |
| On one-sided, topologically mixing and strongly transitive CA with a continuum of period-two points | 2020-03-12 | Paper |
On one-sided, D-chaotic CA without fixed points, having continuum of periodic points with period 2 topological entropy (p) for any prime p
Entropy | 2016-06-15 | Paper |
| On one-sided, topologically mixing cellular automata, having continuum of fixed points and topological entropy \(\log(n)\) for any integer \(n > 1\) | 2014-09-09 | Paper |
| scientific article; zbMATH DE number 6255696 (Why is no real title available?) | 2014-02-05 | Paper |
| On one-sided, D-chaotic cellular automaton, having continuum of fixed points and topological entropy \(\log(3)\) | 2014-02-05 | Paper |
Infinite traces and symbolic dynamics -- the minimal shift case
Fundamenta Informaticae | 2012-05-04 | Paper |
| An example of one-sided, D-chaotic CA over four elementary alphabet, which is not E-chaotic and not injective | 2011-05-18 | Paper |
A dynamical model of parallel computation on bi-infinite time-scale
Journal of Computational and Applied Mathematics | 2011-03-09 | Paper |
Symbolic Dynamics, Flower Automata and Infinite Traces
Implementation and Application of Automata | 2011-02-11 | Paper |
Infinite traces and symbolic dynamics
Theory of Computing Systems | 2009-09-18 | Paper |
| scientific article; zbMATH DE number 5360662 (Why is no real title available?) | 2008-11-03 | Paper |
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
An algorithmic approach to the problem of a semiretract base
Theoretical Computer Science | 2007-01-09 | Paper |
Retractions and retracts of free topological monoids
International Journal of Computer Mathematics | 2006-03-14 | Paper |
Asymptotic behaviour of bi-infinite words
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Asymptotic behaviour of bi-infinite words
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Asymptotic behaviour of bi-infinite words
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Semiretracts -- a counterexample and some results.
Theoretical Computer Science | 2004-03-14 | Paper |
Some Characterization of Recursively Enumerable Sets
International Journal of Computer Mathematics | 2002-01-01 | Paper |
Fixed point generation of varieties of languages
International Journal of Computer Mathematics | 2001-04-05 | Paper |
| scientific article; zbMATH DE number 897896 (Why is no real title available?) | 1996-07-08 | Paper |
Robert Knast (1940-1994)
Semigroup Forum | 1996-03-20 | Paper |
On the family of retracts of free monoids
International Journal of Computer Mathematics | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 30586 (Why is no real title available?) | 1992-06-28 | Paper |
Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies
Semigroup Forum | 1991-01-01 | Paper |
On equality sets of morphisms in topological free monoids
RAIRO - Theoretical Informatics and Applications | 1991-01-01 | Paper |
The poset of retracts of a free monoid
International Journal of Computer Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4043272 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4057817 (Why is no real title available?) | 1987-01-01 | Paper |
Fixed point languages of rational transductions
Semigroup Forum | 1986-01-01 | Paper |
A fixed point characterization of cofinite languages
Semigroup Forum | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3777498 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3746456 (Why is no real title available?) | 1981-01-01 | Paper |
