Ines Klimann

According to our database, Ines Klimann authored at least 23 papers between 2001 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

A New Hierarchy for Automaton Semigroups.

Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin

Int. J. Found. Comput. Sci., 2020

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

2018

On bireversible Mealy automata and the Burnside problem.

Thibault Godin, Ines Klimann

Theor. Comput. Sci., 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

A New Hierarchy for Automaton Semigroups.

Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin

Proceedings of the Implementation and Application of Automata, 2018

To Infinity and Beyond.

Ines Klimann

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016

Automaton Semigroups: The Two-state Case.

Ines Klimann

Theory Comput. Syst., 2016

On level-transitivity and exponential growth.

Ines Klimann

CoRR, 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

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups.

Thibault Godin, Ines Klimann

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata.

Thibault Godin, Ines Klimann, Matthieu Picantin

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Orbit automata as a new tool to attack the order problem in automaton groups.

Ines Klimann, Matthieu Picantin, Dmytro Savchuk

CoRR, 2014

A Characterization of Those Automata That Structurally Generate Finite Groups.

Ines Klimann, Matthieu Picantin

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable.

Ines Klimann

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

On the Finiteness Problem for Automaton (Semi)Groups.

Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin

Int. J. Algebra Comput., 2012

Implementing Computations in Automaton (Semi)groups.

Ines Klimann, Jean Mairesse, Matthieu Picantin

Proceedings of the Implementation and Application of Automata, 2012

2011

On the supports of recognizable series over a field and a single letter alphabet.

Guillaume Chapuy, Ines Klimann

Inf. Process. Lett., 2011

2007

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

CoRR, 2007

2004

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

Theor. Comput. Sci., 2004

2003

A solution to the problem of (A, B)-invariance for series.

Ines Klimann

Theor. Comput. Sci., 2003

Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability.

Ines Klimann

Kybernetika, 2003

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton.

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2001

New types of automata to solve fixed point problems.

Ines Klimann

Theor. Comput. Sci., 2001