| Circular automata synchronize with high probability | 0 | 0.34 | 2021 |
| Orbit expandability of automaton semigroups and groups. | 1 | 0.39 | 2020 |
| Boundary Dynamics For Bireversible And For Contracting Automaton Groups | 0 | 0.34 | 2020 |
| Orbits of Automaton Semigroups and Groups. | 0 | 0.34 | 2019 |
| On the structure theory of partial automaton semigroups | 0 | 0.34 | 2018 |
| Trim Strongly Connected Synchronizing Automata and Ideal Languages. | 0 | 0.34 | 2018 |
| Strongly connected synchronizing automata and the language of minimal reset words | 0 | 0.34 | 2018 |
| Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness | 2 | 0.48 | 2017 |
| Ideal regular languages and strongly connected synchronizing automata. | 1 | 0.36 | 2016 |
| On the Complexity of the Word Problem of Automaton Semigroups and Automaton Groups. | 0 | 0.34 | 2016 |
| Boundary action of automaton groups without singular points and Wang tilings. | 2 | 0.47 | 2016 |
| New reformulations of Cerny's conjecture and related problems. | 0 | 0.34 | 2015 |
| Representation of (Left) Ideal Regular Languages by Synchronizing Automata. | 1 | 0.36 | 2015 |
| Semisimple Synchronizing Automata And The Wedderburn-Artin Theory | 0 | 0.34 | 2014 |
| On the freeness of automata groups. | 0 | 0.34 | 2014 |
| A geometric approach to (semi)-groups defined by automata via dual transducers. | 5 | 0.73 | 2014 |
| On periodic Points of Free inverse Monoid Homomorphisms. | 0 | 0.34 | 2013 |
| Regular Ideal Languages and Synchronizing Automata. | 6 | 0.62 | 2013 |
| Groups And Semigroups Defined By Colorings Of Synchronizing Automata | 3 | 0.55 | 2013 |
| A multi-lane traffic simulation model via continuous cellular automata | 1 | 0.75 | 2013 |
| Fixed points of endomorphisms of trace monoids | 1 | 0.40 | 2012 |
| On Periodic Points Of Free Inverse Monoid Homomorphisms | 0 | 0.34 | 2012 |
| Synchronizing automata with finitely many minimal synchronizing words | 10 | 0.90 | 2011 |
| State Complexity Of Code Operators | 4 | 0.50 | 2011 |
| Multilinear Equations In Amalgams Of Finite Inverse Semigroups | 0 | 0.34 | 2011 |
| Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete | 7 | 0.71 | 2011 |
| Never minimal automata and the rainbow bipartite subgraph problem | 3 | 0.52 | 2011 |
| Bicyclic Subsemigroups In Amalgams Of Finite Inverse Semigroups | 1 | 0.48 | 2010 |
| State complexity of prefix, suffix, bifix and infix operators on regular languages | 2 | 0.44 | 2010 |
| Alphabetical satisfiability problem for trace equations | 0 | 0.34 | 2009 |
| State Complexity For Prefix, Suffix and Bifix operators on regular languages. | 0 | 0.34 | 2009 |
| Finitely Generated Synchronizing Automata | 5 | 1.24 | 2009 |
| Mortality Problem for 2×2 Integer Matrices | 0 | 0.34 | 2008 |
| NP-completeness of the alphabetical satisfiability problem for trace equations. | 0 | 0.34 | 2008 |
