Ines Klimann - Citegraph

Author Info

Name	Affiliation	Papers
INES KLIMANN	LIAFA - CNRS UMR 7089 & Universitéé Paris Diderot-Paris 7, Case 7014, 75205 Paris Cedex 13, France	20
Collaborators	Citations	PageRank
11	86	11.93
Referers	Referees	References
81	72	117

Publications (20 rows)

Collaborators (11 rows)

Referers (81 rows)

Referees (72 rows)

Title	Citations	PageRank	Year
Boundary Dynamics For Bireversible And For Contracting Automaton Groups	0	0.34	2020
To Infinity and Beyond.	0	0.34	2018
On bireversible Mealy automata and the Burnside problem.	0	0.34	2018
On level-transitivity and exponential growth.	0	0.34	2016
Boundary action of automaton groups without singular points and Wang tilings.	2	0.47	2016
Automaton Semigroups: The Two-state Case	5	0.96	2016
Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups.	2	0.47	2016
A Connected 3-State Reversible Mealy Automaton Cannot Generate An Infinite Burnside Group	4	0.57	2015
Orbit automata as a new tool to attack the order problem in automaton groups.	1	0.41	2014
A characterization of those automata that structurally generate finite groups.	0	0.34	2014
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable	9	0.93	2013
Implementing computations in automaton (semi)groups	7	0.90	2012
On The Finiteness Problem For Automaton (Semi) Groups	14	1.50	2011
On the supports of recognizable series over a field and a single letter alphabet	1	0.43	2011
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton	1	0.35	2007
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton	36	1.44	2004
A solution to the problem of (A, B)-invariance for series.	3	0.43	2003
Deciding the sequentiality of a finitely ambiguous max-plus automaton	0	0.34	2003
Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability.	0	0.34	2003
New types of automata to solve fixed point problems	1	0.71	2001