Nicolas Bedon

According to our database1, Nicolas Bedon authored at least 18 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Branching Automata and Pomset Automata.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Logic and rational languages of scattered and countable series-parallel posets.
Theor. Comput. Sci., 2020

Equational Theories of Scattered and Countable Series-Parallel Posets.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2018
Complementation of Branching Automata for Scattered and Countable N-Free Posets.
Int. J. Found. Comput. Sci., 2018

2016
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Logic and Branching Automata.
Log. Methods Comput. Sci., 2015

2012
Schützenberger and Eilenberg theorems for words on linear orderings.
J. Comput. Syst. Sci., 2012

2011
Series-parallel languages on scattered and countable posets.
Theor. Comput. Sci., 2011

2010
Logic and Rational Languages of Words Indexed by Linear Orderings.
Theory Comput. Syst., 2010

2009
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2004
Corosol, une JVM modulaire paramétrable à la volée.
Obj. Logiciel Base données Réseaux, 2004

2003
MyJVM: a 100% pure Java customizable Java Virtual Machine.
Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

2001
Logic over Words on Denumerable Ordinals.
J. Comput. Syst. Sci., 2001

Star-Free Sets of Words on Ordinals.
Inf. Comput., 2001

1998
Langages reconnaissables de mots indexés par des ordinaux.
PhD thesis, 1998

Automata, Semigroups and Recognizability of Words on Ordinals.
Int. J. Algebra Comput., 1998

An Eilenberg Theorem for Words on Countable Ordinals.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1996
Finite Automata and Ordinals.
Theor. Comput. Sci., 1996


  Loading...