| Publication | Date of Publication | Type |
|---|
Applications of Automaton Groups in Cryptography
| 2023-06-18 | Paper |
On a class of poly-context-free groups generated by automata
Journal of Algebra | 2023-04-27 | Paper |
Generalizations of the Muller-Schupp theorem and tree-like inverse graphs
| 2023-02-13 | Paper |
On the orbits of automaton semigroups and groups
| 2022-07-27 | Paper |
The Self-Similarity of Free Semigroups and Groups
| 2022-05-20 | Paper |
On a class of poly-context-free groups generated by automata
| 2022-05-18 | Paper |
Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
Israel Journal of Mathematics | 2022-04-25 | Paper |
Graph automaton groups
| 2021-10-04 | Paper |
Circular automata synchronize with high probability
Journal of Combinatorial Theory. Series A | 2021-02-02 | Paper |
On an uncountable family of graphs whose spectrum is a Cantor set
| 2021-01-19 | Paper |
Catalan fragile words
| 2020-09-18 | Paper |
Fragile words and Cayley type transducers
| 2020-09-17 | Paper |
On the structure theory of partial automaton semigroups
Semigroup Forum | 2020-08-12 | Paper |
On the Orbits of Automaton Semigroups and Groups
| 2020-07-16 | Paper |
Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
Israel Journal of Mathematics | 2020-06-18 | Paper |
Boundary dynamics for bireversible and for contracting automaton groups
International Journal of Algebra and Computation | 2020-03-25 | Paper |
Infinite automaton semigroups and groups have infinite orbits
Journal of Algebra | 2020-03-24 | Paper |
Orbit expandability of automaton semigroups and groups
Theoretical Computer Science | 2020-01-29 | Paper |
Missing factors of ideals and synchronizing automata
| 2020-01-15 | Paper |
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
Journal of Algebraic Combinatorics | 2019-12-06 | Paper |
On the Structure Theory of Partial Automaton Semigroups
| 2018-11-23 | Paper |
Trim Strongly Connected Synchronizing Automata and Ideal Languages
Fundamenta Informaticae | 2018-10-02 | Paper |
Strongly connected synchronizing automata and the language of minimal reset words
Advances in Applied Mathematics | 2018-06-08 | Paper |
Equalizers and kernels in categories of monoids
Semigroup Forum | 2018-02-28 | Paper |
Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups
Publications de l'Institut Math?matique (Belgrade) | 2017-07-19 | Paper |
On the complexity of the word problem for automaton semigroups and automaton groups
Advances in Applied Mathematics | 2017-07-13 | Paper |
Ideal regular languages and strongly connected synchronizing automata
Theoretical Computer Science | 2016-10-21 | Paper |
The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
Communications in Algebra | 2016-10-12 | Paper |
Undecidability of the word problem for Yamamura's HNN-extension under nice conditions.
Semigroup Forum | 2016-08-30 | Paper |
Freeness of automaton groups vs boundary dynamics
Journal of Algebra | 2016-07-08 | Paper |
Semisimple synchronizing automata and the Wedderburn-Artin theory
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
Boundary action of automaton groups without singular points and Wang tilings
| 2016-04-26 | Paper |
Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
Semigroups, Algebras and Operator Theory | 2015-11-05 | Paper |
Representation of (left) ideal regular languages by synchronizing automata
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Maximal subgroups of amalgams of finite inverse semigroups.
Semigroup Forum | 2015-06-25 | Paper |
A geometric approach to (semi)-groups defined by automata via dual transducers.
Geometriae Dedicata | 2015-02-19 | Paper |
Groups and semigroups defined by colorings of synchronizing automata.
International Journal of Algebra and Computation | 2014-12-12 | Paper |
Fixed points of endomorphisms of trace monoids.
Semigroup Forum | 2014-11-03 | Paper |
Semisimple synchronizing automata and the Wedderburn-Artin theory
Developments in Language Theory | 2014-10-14 | Paper |
On periodic points of free inverse monoid homomorphisms.
International Journal of Algebra and Computation | 2014-04-25 | Paper |
Fixed points of endomorphisms of graph groups.
Journal of Group Theory | 2014-01-07 | Paper |
Regular ideal languages and synchronizing automata
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Amalgams of inverse semigroups and reversible two-counter machines.
Journal of Pure and Applied Algebra | 2013-06-24 | Paper |
Amalgams of finite inverse semigroups and deterministic context-free languages.
Semigroup Forum | 2012-11-08 | Paper |
State complexity of code operators
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Union-Closed vs Upward-Closed Families of Finite Sets
| 2012-08-27 | Paper |
Amalgams vs Yamamura's HNN-extensions of inverse semigroups.
Algebra Colloquium | 2011-10-25 | Paper |
Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
Models of Computation in Context | 2011-09-09 | Paper |
Never minimal automata and the rainbow bipartite subgraph problem
Developments in Language Theory | 2011-07-29 | Paper |
Synchronizing automata with finitely many minimal synchronizing words
Information and Computation | 2011-07-27 | Paper |
MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
International Journal of Algebra and Computation | 2011-05-03 | Paper |
State complexity of prefix, suffix, bifix and infix operators on regular languages
Developments in Language Theory | 2010-08-31 | Paper |
Bicyclic subsemigroups in amalgams of finite inverse semigroups.
International Journal of Algebra and Computation | 2010-04-15 | Paper |
Alphabetical satisfiability problem for trace equations
| 2010-04-08 | Paper |
Finitely Generated Synchronizing Automata
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
Semigroup Forum | 2008-12-02 | Paper |
Mortality Problem for 2×2 Integer Matrices
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Some lower bounds for status in finite semigroups.
| 2006-06-27 | Paper |
The Freeness Problem for Automaton Semigroups
| N/A | Paper |
