Nathanaël FIJALKOW
Nathanaël Fijalkow Chargé de Recherches ()

Équipe LaBRI : Méthodes formelles
Page personnelle : http://www.labri.fr/perso/nfijalkow
Courrier électronique : nathanael.fijalkowarobaselabri.fr
Bureau : 268
Tél : +33 (0)5 40 00 37 97


Extrait de publications


Krishnendu Chatterjee, Nathanaël Fijalkow. Pushdown Boundedness Games. 2016

Nathanaël Fijalkow. Lower Bounds for Alternating Online State Complexity. 2016

Nathanaël Fijalkow. Characterisation of an Algebraic Algorithm for Probabilistic Automata Characterisation of an Algebraic Algorithm for Probabilistic Automata. STACS, Symposium on Theoretical Aspects of Computer Science, Feb 2016, Orléans, France

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj. Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, pp.37

Nathanaël Fijalkow. What is known about the Value 1 Problem for Probabilistic Automata?. 2014


Page mise à jour le 13/08/2010 à 10:56