Ines Klimann

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:12/1449 · DBLP profile ↗

← Back

15ranked-venue papers

10as first author

0since 2021 · last 2018

0000-0002-1621-9264ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 15 · 10 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Automata and formal languages · 50% Combinatorics and discrete mathematics · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Combinatorics and discrete mathematics group theory	0.3	1	2018	To Infinity and Beyond · ICALP 2018
Automata and formal languages › finite automata › sequential machines mealy machine	0.3	1	2018	To Infinity and Beyond · ICALP 2018

Methods — techniques the papers use, named apart from their topics

automaton groups · 0.3

Year	Publication	Venue	Position
2018	To Infinity and Beyond abstract We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, then it must have exponential growth. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. Ines Klimann	ICALP	1
2018	A New Hierarchy for Automaton Semigroups Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin	CIAA	3
2018	On bireversible Mealy automata and the Burnside problem Thibault Godin, Ines Klimann	Theor. Comput. Sci.	2
2016	Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups Thibault Godin, Ines Klimann	MFCS	2
2016	Automaton Semigroups: The Two-state Case Ines Klimann	Theory Comput. Syst.	1
2015	A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group Ines Klimann, Matthieu Picantin, Dmytro Savchuk	DLT	1
2015	On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata Thibault Godin, Ines Klimann, Matthieu Picantin	LATA	2
2014	A Characterization of Those Automata That Structurally Generate Finite Groups Ines Klimann, Matthieu Picantin	LATIN	1
2013	The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable abstract We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata. Ines Klimann	STACS	1
2012	Implementing Computations in Automaton (Semi)groups Ines Klimann, Jean Mairesse, Matthieu Picantin	CIAA	1
2011	On the supports of recognizable series over a field and a single letter alphabet Guillaume Chapuy, Ines Klimann	Inf. Process. Lett.	2
2004	Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur 0002	Theor. Comput. Sci.	1
2003	Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur 0002	Developments in Language Theory	1
2003	A solution to the problem of (A, B)-invariance for series Ines Klimann	Theor. Comput. Sci.	1
2001	New types of automata to solve fixed point problems Ines Klimann	Theor. Comput. Sci.	1