Ines Klimann - RankMe

33 papers A* 1A 1B 2C 5Journal 24

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