papers
Publications (12)
cs.FL2017
To Infinity and Beyond
Ines Klimann
cs.FL2018
A new hierarchy for automaton semigroups
Laurent Bartholdi, Thibault Godin, Ines Klimann +1
cs.FL2014
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
cs.FL2013
A characterization of those automata that structurally generate finite groups
Ines Klimann, Matthieu Picantin
cs.FL2011
On the Finiteness Problem for Automaton (Semi)groups
Ali Akhavi, Ines Klimann, Sylvain Lombardy +2
cs.FL2013
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
Ines Klimann
cs.FL2013
Implementing Computations in Automaton (Semi)groups
Ines Klimann, Jean Mairesse, Matthieu Picantin
cs.FL2014
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
Thibault Godin, Ines Klimann, Matthieu Picantin
cs.CC2007
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton
Ines Klimann, Sylvain Lombardy, Jean Mairesse +1
cs.FL2016
On level-transitivity and exponential growth
Ines Klimann
cs.FL2016
Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
Thibault Godin, Ines Klimann
math.GR2014
Orbit automata as a new tool to attack the order problem in automaton groups
Ines Klimann, Matthieu Picantin, Dmytro Savchuk