New types of automata to solve fixed point problems. - Ines Klimann (Theor. Comput. Sci., 2001)

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. - Ines Klimann; Sylvain Lombardy; Jean Mairesse; Christophe Prieur 002 (Developments in Language Theory, 2003)

Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability. - Ines Klimann (Kybernetika, 2003)

A solution to the problem of (A, B)-invariance for series. - Ines Klimann (Theor. Comput. Sci., 2003)

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. - Ines Klimann; Sylvain Lombardy; Jean Mairesse; Christophe Prieur 002 (Theor. Comput. Sci., 2004)

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton - Ines Klimann; Sylvain Lombardy; Jean Mairesse; Christophe Prieur 002 (CoRR, 2007)

On the supports of recognizable series over a field and a single letter alphabet. - Guillaume Chapuy; Ines Klimann (Inf. Process. Lett., 2011)

Implementing Computations in Automaton (Semi)groups. - Ines Klimann; Jean Mairesse; Matthieu Picantin (CIAA, 2012)

On the Finiteness Problem for Automaton (Semi)Groups. - Ali Akhavi; Ines Klimann; Sylvain Lombardy; Jean Mairesse; Matthieu Picantin (Int. J. Algebra Comput., 2012)

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. - Ines Klimann (STACS, 2013)

A Characterization of Those Automata That Structurally Generate Finite Groups. - Ines Klimann; Matthieu Picantin (LATIN, 2014)

Orbit automata as a new tool to attack the order problem in automaton groups. - Ines Klimann; Matthieu Picantin; Dmytro Savchuk (CoRR, 2014)

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. - Thibault Godin; Ines Klimann; Matthieu Picantin (LATA, 2015)

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups. - Thibault Godin; Ines Klimann (MFCS, 2016)

Boundary action of automaton groups without singular points and Wang tilings. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (CoRR, 2016)

On level-transitivity and exponential growth. - Ines Klimann (CoRR, 2016)

Automaton Semigroups: The Two-state Case. - Ines Klimann (Theory Comput. Syst., 2016)

To Infinity and Beyond. - Ines Klimann (ICALP, 2018)

A New Hierarchy for Automaton Semigroups. - Laurent Bartholdi; Thibault Godin; Ines Klimann; Matthieu Picantin (CIAA, 2018)

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. - Ines Klimann; Matthieu Picantin; Dmytro Savchuk (Int. J. Found. Comput. Sci., 2018)

On bireversible Mealy automata and the Burnside problem. - Thibault Godin; Ines Klimann (Theor. Comput. Sci., 2018)

Boundary dynamics for bireversible and for contracting automaton groups. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (Int. J. Algebra Comput., 2020)

A New Hierarchy for Automaton Semigroups. - Laurent Bartholdi; Thibault Godin; Ines Klimann; Camille Noûs; Matthieu Picantin (Int. J. Found. Comput. Sci., 2020)