Skip to main content
Nathanaël Fijalkow

Research Blog

Games Automata Play

Parity games

Upper and lower bounds for universal trees

Read post
Research

Advice

Read post
Learning theory

Fliess' theorem for minimising weighted automata

Read post
Learning theory

Angluin's style learning for weighted automata

Read post
Automata

The universality problem for automata with bounded ambiguity

Read post
Parity games

Value iteration for parity games

Read post
Weighted automata

Boundedness for (min,plus)-automata

Read post
Parity games

The interplay between parity games and universal trees

Read post
Learning theory

Weighted automata and matrix factorisations

Read post
Weighted automata

A polynomial time algorithm for the equivalence problem of weighted automata over a field

Read post
Research

Applying to CNRS

Read post

Nathanaël Fijalkow

351, cours de la Libération F-33405 Talence cedex, France

nathanael.fijalkow@gmail.com
How to find my office
made by superskrypt
  • Home
  • Curriculum Vitae
  • Publications
  • Research blog

Nathanaël Fijalkow

nathanael.fijalkow@gmail.com
made by superskrypt