Search - Université Paris Cité Access content directly

Filter your results

14 Results
authFullName_s : Ines Klimann

On the finiteness problem for automaton (semi)groups

Ali Akhavi , Ines Klimann , Sylvain Lombardy , Jean Mairesse , Matthieu Picantin et al.
International Journal of Algebra and Computation, 2012, 22 (06), pp.1250052.1-1250052.26. ⟨10.1142/S021819671250052X⟩
Journal articles hal-00695445v1
Image document

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

Ines Klimann , Sylvain Lombardy , Jean Mairesse , Christophe Prieur
Theoretical Computer Science, 2004, 327 (3), pp.349-373. ⟨10.1016/j.tcs.2004.02.049⟩
Journal articles hal-00174171v1
Image document

Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups

Thibault Godin , Ines Klimann
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Piotr Faliszewski; Anca Muscholl; Rolf Niedermeier, Aug 2016, Cracovie, Poland. pp.44:1--44:14
Conference papers hal-01296590v2
Image document

Une introduction aux (semi-)groupes d'automate

Ines Klimann
Master. Une introduction aux (semi-)groupes d'automate, MPRI, 2013, pp.21
Lectures cel-01058503v1
Image document

On level-transitivity and exponential growth

Ines Klimann
Preprints, Working Papers, ... hal-01323857v2

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

Ines Klimann
Theoretical Computer Science, 2003, 293/1, pp.115-139
Journal articles hal-00019867v1
Image document

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

Guillaume Chapuy , Ines Klimann
Information Processing Letters, 2011, 111 (23-24), pp.1096-1098. ⟨10.1016/j.ipl.2011.09.010⟩
Journal articles hal-00663147v1

Some representations for series on idempotent semirings

Ines Klimann
Kybernetika, 2003, 39 (2), pp.177-192
Journal articles hal-00160790v1
Image document

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

Ines Klimann
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Feb 2013, Kiel, Germany. pp.502--513, ⟨10.4230/LIPIcs.STACS.2013.502⟩
Conference papers hal-00875177v1

New types of automata to solve fixed point problems

Ines Klimann
Theoretical Computer Science, 2001, 259/1-2, pp.183-197
Journal articles hal-00019865v1

Deciding the sequentiality of a finitely ambiguous max-plus automaton

Ines Klimann , Sylvain Lombardy , Jean Mairesse , Christophe Prieur
7th International Conference on Developments in Language Theory (DLT 2003), Jul 2003, Szeged, Hungary, Hungary. pp.373-385
Conference papers hal-00620031v1
Image document

To Infinity and Beyond

Ines Klimann
Preprints, Working Papers, ... hal-01575586v2

Deciding the sequentiality of a finitely ambiguous Max-Plus automaton

Ines Klimann , Sylvain Lombardy , Jean Mairesse , Christophe Prieur
2003, pp.373-385
Conference papers hal-00017208v1
Image document

A characterization of those automata that structurally generate finite groups

Ines Klimann , Matthieu Picantin
11th Latin American Theoretical INformatics Symposium (LATIN 2014), 2014, Uruguay. pp.180--189
Conference papers hal-00877087v1