Ines Klimann

Publication Activity (10 Years)

Years Active: 2001-2020
Publications (10 Years): 15

Top Topics

Hierarchically Organized

Automatically Generating

Singular Points

Finite State Automaton

Top Venues

Int. J. Found. Comput. Sci.

Int. J. Algebra Comput.

Publications

Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin
A New Hierarchy for Automaton Semigroups. Int. J. Found. Comput. Sci. 31 (8) (2020)
Daniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro
Boundary dynamics for bireversible and for contracting automaton groups. Int. J. Algebra Comput. 30 (02) (2020)
Thibault Godin, Ines Klimann
On bireversible Mealy automata and the Burnside problem. Theor. Comput. Sci. 707 (2018)
Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin
A new hierarchy for automaton semigroups. CoRR (2018)
Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin
A New Hierarchy for Automaton Semigroups. CIAA (2018)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. Int. J. Found. Comput. Sci. 29 (2) (2018)
Ines Klimann
To Infinity and Beyond. ICALP (2018)
Ines Klimann
To Infinity and Beyond. CoRR (2017)
Thibault Godin, Ines Klimann
Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups. MFCS (2016)
Daniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro
Boundary action of automaton groups without singular points and Wang tilings. CoRR (2016)
Thibault Godin, Ines Klimann
Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups. CoRR (2016)
Ines Klimann
On level-transitivity and exponential growth. CoRR (2016)
Ines Klimann
Automaton Semigroups: The Two-state Case. Theory Comput. Syst. 58 (4) (2016)
Thibault Godin, Ines Klimann, Matthieu Picantin
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. LATA (2015)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. DLT (2015)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group. CoRR (2014)
Thibault Godin, Ines Klimann, Matthieu Picantin
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. CoRR (2014)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
Orbit automata as a new tool to attack the order problem in automaton groups. CoRR (2014)
Ines Klimann, Matthieu Picantin
A Characterization of Those Automata That Structurally Generate Finite Groups. LATIN (2014)
Ines Klimann, Jean Mairesse, Matthieu Picantin
Implementing Computations in Automaton (Semi)groups. CoRR (2013)
Ines Klimann, Matthieu Picantin
A characterization of those automata that structurally generate finite groups. CoRR (2013)
Ines Klimann
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. STACS (2013)
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
On the Finiteness Problem for Automaton (Semi)Groups. Int. J. Algebra Comput. 22 (6) (2012)
Ines Klimann
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable CoRR (2012)
Ines Klimann, Jean Mairesse, Matthieu Picantin
Implementing Computations in Automaton (Semi)groups. CIAA (2012)
Guillaume Chapuy, Ines Klimann
On the supports of recognizable series over a field and a single letter alphabet. Inf. Process. Lett. 111 (23-24) (2011)
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
On the Finiteness Problem for Automaton (Semi)groups CoRR (2011)
Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton CoRR (2007)
Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327 (3) (2004)
Ines Klimann
Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability. Kybernetika 39 (2) (2003)
Ines Klimann
A solution to the problem of (A, B)-invariance for series. Theor. Comput. Sci. 293 (1) (2003)
Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Developments in Language Theory (2003)
Ines Klimann
New types of automata to solve fixed point problems. Theor. Comput. Sci. 259 (1-2) (2001)