| Holonomy theorem for finite semigroups | 0 | 0.34 | 2022 |
| Truncated Boolean Representable Simplicial Complexes | 0 | 0.34 | 2020 |
| On Finitely Generated Submonoids Of Virtually Free Groups | 0 | 0.34 | 2018 |
| Towards an Automated Analysis of Forearm Thermal Images During Handgrip Exercise | 0 | 0.34 | 2018 |
| The Lattice Of Flats Of A Boolean Representable Simplicial Complex | 0 | 0.34 | 2018 |
| On finitely generated submonoids of free groups. | 0 | 0.34 | 2017 |
| On uniformly continuous functions for some profinite topologies. | 0 | 0.34 | 2017 |
| On The Topology Of A Boolean Representable Simplicial Complex | 0 | 0.34 | 2017 |
| Random Walks On Semaphore Codes And Delay De Bruijn Semigroups | 0 | 0.34 | 2016 |
| The Semaphore Codes Attached To A Turing Machine Via Resets And Their Various Limits | 0 | 0.34 | 2016 |
| A noncommutative extension of Mahler's theorem on interpolation series | 5 | 0.78 | 2014 |
| Applying ISO/IEC 25010 Standard to Prioritize and Solve Quality Issues of Automatic ETL Processes | 0 | 0.34 | 2014 |
| On periodic Points of Free inverse Monoid Homomorphisms. | 0 | 0.34 | 2013 |
| Groups and Automata: a Perfect Match. | 1 | 0.40 | 2012 |
| Fixed points of endomorphisms of virtually free groups | 4 | 0.56 | 2012 |
| Further Results On Monoids Acting On Trees | 1 | 0.43 | 2012 |
| Fixed points of endomorphisms of trace monoids | 1 | 0.40 | 2012 |
| On Periodic Points Of Free Inverse Monoid Homomorphisms | 0 | 0.34 | 2012 |
| Fixed points of endomorphisms of certain free products. | 3 | 0.68 | 2012 |
| Finite Idempotent Inverse Monoid Presentations | 0 | 0.34 | 2011 |
| Never minimal automata and the rainbow bipartite subgraph problem | 3 | 0.52 | 2011 |
| On Profinite Uniform Structures Defined By Varieties Of Finite Monoids | 6 | 1.11 | 2011 |
| Rational subsets of groups | 2 | 0.40 | 2010 |
| Computing Maximal Error-detecting Capabilities and Distances of Regular Languages | 7 | 0.59 | 2010 |
| Groups defined by automata | 6 | 0.56 | 2010 |
| Automorphic Orbits In Free Groups: Words Versus Subgroups | 3 | 0.50 | 2010 |
| Building High Quality Databases for Minority Languages such as Galician. | 2 | 0.42 | 2010 |
| Infinite Words And Confluent Rewriting Systems: Endomorphism Extensions | 6 | 1.21 | 2009 |
| Turing machines and bimachines | 1 | 0.36 | 2008 |
| Rational subsets of partially reversible monoids | 3 | 0.73 | 2008 |
| On an algorithm to decide whether a free group is a free factor of another | 3 | 0.69 | 2008 |
| A Mahler's theorem for functions from words to integers | 5 | 0.77 | 2008 |
| What is a maximal error-detecting capability of a formal language? | 0 | 0.34 | 2008 |
| A topological approach to transductions | 9 | 0.74 | 2005 |
| On A Class Of Automata Groups Generalizing Lamplighter Groups | 19 | 3.56 | 2005 |
| Free group languages: Rational versus recognizable | 6 | 1.27 | 2004 |
| An Application Of First-Order Logic To The Study Of Recognizable Languages | 2 | 0.48 | 2004 |
| A note on pure and p-pure languages | 1 | 0.44 | 2003 |
| Periodicity vectors for labelled trees | 0 | 0.34 | 2003 |
| The homomorphism problem for trace monoids | 0 | 0.34 | 2003 |
| On Fine and Wilf's theorem for bidimensional words | 13 | 1.16 | 2003 |
| Extensions and submonoids of automatic monoids | 4 | 0.54 | 2002 |
| Recognizable Subsets of a Group: Finite Extensions and the Abelian Case | 2 | 0.67 | 2002 |
| On the lattice of prefix codes | 3 | 0.48 | 2002 |
| The homomorphism problem for the free monoid | 1 | 0.40 | 2002 |
| SC-hyperdecidability of R | 1 | 0.38 | 2001 |
| Implementing MPI-2 Extended Collective Operations | 2 | 0.42 | 1999 |
| Conjugacy and Transposition for Inverse Monoid Presentations. | 3 | 0.90 | 1996 |
| On Free Inverse Monoid Languages | 13 | 1.15 | 1996 |
