Ines Klimann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2020

A New Hierarchy for Automaton SemigroupsLaurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin. ijfcs, 31(8):1069-1089, 2020. [doi]

Boundary dynamics for bireversible and for contracting automaton groupsDaniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro. ijac, 30(02):431-449, 2020. [doi]

2018

2016

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside GroupsThibault Godin, Ines Klimann. mfcs 2016: [doi]

Automaton Semigroups: The Two-state CaseInes Klimann. mst, 58(4):664-680, 2016. [doi]

2015

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy AutomataThibault Godin, Ines Klimann, Matthieu Picantin. LATA 2015: 328-339 [doi]

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside GroupInes Klimann, Matthieu Picantin, Dmytro Savchuk. dlt 2015: 313-325 [doi]

2014

A Characterization of Those Automata That Structurally Generate Finite GroupsInes Klimann, Matthieu Picantin. latin 2014: 180-189 [doi]

2013

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidableInes Klimann. STACS 2013: 502-513 [doi]

2012

On the Finiteness Problem for Automaton (Semi)GroupsAli Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin. ijac, 22(6), 2012. [doi]

Implementing Computations in Automaton (Semi)groupsInes Klimann, Jean Mairesse, Matthieu Picantin. wia 2012: 240-252 [doi]

2011

On the supports of recognizable series over a field and a single letter alphabetGuillaume Chapuy, Ines Klimann. ipl, 111(23-24):1096-1098, 2011. [doi]

2007

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus AutomatonInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. corr, abs/0709.4117, 2007. [doi]

2004

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automatonInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. TCS, 327(3):349-373, 2004. [doi]

2003

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus AutomatonInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. dlt 2003: 373-385 [doi]

A solution to the problem of (A, B)-invariance for seriesInes Klimann. TCS, 293(1):115-139, 2003. [doi]

Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representabilityInes Klimann. kybernetika, 39(2):177-192, 2003. [doi]

2001

New types of automata to solve fixed point problemsInes Klimann. TCS, 259(1-2):183-197, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL