关注
Olivier Carton
Olivier Carton
IRIF & Université de Paris
在 irif.fr 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
MP Béal, O Carton, C Prieur, J Sakarovitch
Theoretical Computer Science 292 (1), 45-63, 2003
1252003
Unambiguous büchi automata
O Carton, M Michel
Theoretical Computer Science 297 (1-3), 37-81, 2003
882003
The monadic theory of morphic infinite words and generalizations
O Carton, W Thomas
Information and Computation 176 (1), 51-65, 2002
832002
Langages formels, calculabilité et complexité
O Carton
Vuibert, 2008
732008
Minimization of automata
J Berstel, L Boasson, O Carton, I Fagnot
arXiv preprint arXiv:1010.5318, 2010
642010
Determinization of transducers over finite and infinite words
MP Béal, O Carton
Theoretical Computer Science 289 (1), 225-251, 2002
572002
On the complexity of Hopcroft’s state minimization algorithm
J Berstel, O Carton
Implementation and Application of Automata: 9th International Conference …, 2005
532005
Automata on linear orderings
V Bruyere, O Carton
Journal of Computer and System Sciences 73 (1), 1-24, 2007
522007
Automata on linear orderings
V Bruyere, O Carton
Mathematical Foundations of Computer Science 2001: 26th International …, 2001
522001
Computing the Rabin index of a parity automaton
O Carton, R Maceiras
RAIRO-Theoretical Informatics and Applications 33 (6), 495-505, 1999
521999
Chains and superchains for ω-rational sets, automata and semigroups
O Carton, D Perrin
International Journal of Algebra and Computation 7 (06), 673-695, 1997
441997
The Wagner hierarchy
O Carton, D Perrin
International Journal of Algebra and Computation 9 (05), 597-620, 1999
421999
Complementation of rational sets on countable scattered linear orderings
C Rispal, O Carton
International Journal of Foundations of Computer Science 16 (04), 767-786, 2005
382005
Aperiodic two-way transducers and FO-transductions
O Carton, L Dartois
arXiv preprint arXiv:2103.15651, 2021
352021
Decision problems among the main subfamilies of rational relations
O Carton, C Choffrut, S Grigorieff
RAIRO-Theoretical Informatics and Applications 40 (2), 255-275, 2006
312006
An Eilenberg theorem for words on countable ordinals
N Bedon, O Carton
LATIN'98: Theoretical Informatics: Third Latin American Symposium Campinas …, 1998
301998
Normality and automata
V Becher, O Carton, PA Heiber
Journal of Computer and System Sciences 81 (8), 1592-1613, 2015
282015
Regular languages of words over countable linear orderings
O Carton, T Colcombet, G Puppis
International Colloquium on Automata, Languages, and Programming, 125-136, 2011
272011
Squaring transducers: An efficient procedure for deciding functionality and sequentiality of transducers
MP Béal, O Carton, C Prieur, J Sakarovitch
LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000
252000
Automata and semigroups recognizing infinite words.
O Carton, D Perrin, JE Pin
Logic and automata 2, 133-168, 2008
242008
系统目前无法执行此操作，请稍后再试。
文章 1–20