Olivier Carton
Professeur
62
Documents
Affiliations actuelles
- 557826
Identifiants chercheurs
- olivier-carton
- 0000-0002-2728-6534
- Arxiv : carton_o_1
Publications
|
Preservation of normality by transducersInformation and Computation, 2022, 282, pp.104650. ⟨10.1016/j.ic.2020.104650⟩
Article dans une revue
hal-03660658v1
|
|
Continuity of functional transducers: a profinite study of rational functionsLogical Methods in Computer Science, 2020, ⟨10.23638/LMCS-16(1:24)2020⟩
Article dans une revue
hal-03111682v1
|
|
Normal numbers and nested perfect necklacesJournal of Complexity, 2019, 54, pp.101403 -. ⟨10.1016/j.jco.2019.03.003⟩
Article dans une revue
hal-03488341v1
|
|
Polishness of some topologies related to word or tree automataLogical Methods in Computer Science, 2019, ⟨10.23638/LMCS-15(2:9)2019⟩
Article dans une revue
hal-01593160v3
|
|
An algebraic approach to MSO-definability on countable linear orderingsThe Journal of Symbolic Logic, 2018, 83 (3), pp.1147-1189. ⟨10.1017/jsl.2018.7⟩
Article dans une revue
hal-01470325v2
|
|
A Survey on Difference Hierarchies of Regular LanguagesLogical Methods in Computer Science, 2018, 14, pp.1 - 23. ⟨10.23638/LMCS-14(1:24)2018⟩
Article dans une revue
hal-02104436v1
|
Wavelength-Selective Shape Memory Alloy for Wireless Microactuation of a Bistable Curved BeamIEEE Transactions on Industrial Electronics, 2011, 58 (12), pp.5288 - 5295. ⟨10.1109/tie.2010.2046609⟩
Article dans une revue
hal-01911359v1
|
|
Logic and Rational Languages of Words Indexed by Linear Orderings.Theory of Computing Systems, 2010, 46 (4), pp.737-760
Article dans une revue
hal-00790136v1
|
|
The expressive power of the shuffle productInformation and Computation, 2010, 208 (11), pp.1258-1272. ⟨10.1016/j.ic.2010.06.002⟩
Article dans une revue
hal-00619766v1
|
|
|
Sturmian TreesTheory of Computing Systems, 2010, 46 (3), pp.443-478
Article dans une revue
hal-00619760v1
|
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithmTheoretical Computer Science, 2009, 410 (30-32), pp.2811-2822. ⟨10.1016/j.tcs.2009.01.039⟩
Article dans une revue
hal-00619761v1
|
|
Tree Automata and Automata on Linear OrderingsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.321-338
Article dans une revue
hal-00403681v1
|
|
|
On the Continuity Set of an omega Rational FunctionRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42 ((1)), pp.183-196
Article dans une revue
ensl-00216624v1
|
|
Complementation of Rational sets on Scattered Linear Orderings of Finite RankTheoretical Computer Science, 2007, 382 (2), pp.109-119. ⟨10.1016/j.tcs.2007.03.008⟩
Article dans une revue
hal-00619538v1
|
|
Automata on linear orderingsJournal of Computer and System Sciences, 2007, 73 (1), pp.1-24
Article dans une revue
hal-00160925v1
|
|
The growth ratio of synchronous rational relations is uniqueTheoretical Computer Science, 2007, 376, pp.52-59
Article dans une revue
hal-00160891v1
|
|
A Kleene Theorem for Languages of Words Indexed by Linear OrderingsInternational Journal of Foundations of Computer Science, 2006, 17 (3), pp.519-542
Article dans une revue
hal-00160976v1
|
|
Operations preserving recognizable languagesTheoretical Computer Science, 2006, 354, pp.405-420. ⟨10.1007/978-3-540-45077-1_32.pdf⟩
Article dans une revue
hal-00112842v1
|
Decision problems among the main subfamilies of rational relationsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40, pp.255--275
Article dans une revue
hal-00160967v1
|
|
Decision problems among the main subfamilies of rational relationsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40 (2), pp.255-276. ⟨10.1051/ita:2006005⟩
Article dans une revue
hal-00158271v1
|
|
|
Complementation of Rational Sets on Countable Scattered Linear OrderingsInternational Journal of Foundations of Computer Science, 2005, 16 (4), pp.767-786. ⟨10.1007/978-3-540-30550-7_32⟩
Article dans une revue
hal-00160985v1
|
|
Hierarchy among Automata on Linear OrderingsTheory of Computing Systems, 2005, 38 (5), pp.593-621
Article dans une revue
hal-00161039v1
|
|
Determinization of transducers over infinite words: the general caseTheory of Computing Systems, 2004, 37 (4), pp.483-502
Article dans une revue
hal-00619205v1
|
|
Determinization of transducers over infinite words: the general caseTheory of Computing Systems, 2004, 37 (4), pp.483-502
Article dans une revue
hal-00162483v1
|
Unambiguous Büchi automataTheoretical Computer Science, 2003, 297 (1), pp.37-81
Article dans une revue
hal-00619536v1
|
|
Squaring transducers: An efficient procedure for deciding functionality and sequentialityTheoretical Computer Science, 2003, 292 (1), pp.45-63
Article dans une revue
hal-00619218v1
|
|
|
Determinization of transducers over finite and infinite wordsTheoretical Computer Science, 2002, 289 (1), pp.225-251
Article dans une revue
hal-00619203v1
|
Accessibility in automata on scattered linear orderingsMATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 (?), pp.155--164
Article dans une revue
hal-00693661v1
|
|
|
Computing the prefix of an automatonInformatique Théorique et Applications, 2000, 34 (6), pp.503-514
Article dans une revue
hal-00619217v1
|
|
Asynchronous sliding block mapsInformatique Théorique et Applications, 2000, 34 (2), pp.139-156
Article dans une revue
hal-00619216v1
|
Computing the Rabin index of a parity automatonRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 1999, 33 (6), pp.495--505. ⟨10.1051/ita:1999129⟩
Article dans une revue
hal-00693809v1
|
|
The Wadge-Wagner hierarchy of omega-rational setsAUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 (?), pp.17--35
Article dans une revue
hal-00693993v1
|
Preservation of Normality by Unambiguous TransducersDevelopments in Language Theory 2022, May 2022, Tampa, United States. pp.90-101, ⟨10.1007/978-3-031-05578-2_7⟩
Communication dans un congrès
hal-03759051v1
|
|
|
Counter Machines and Distributed Automata24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.13-28, ⟨10.1007/978-3-319-92675-9_2⟩
Communication dans un congrès
hal-01824873v1
|
Simon’s theorem for scattered words,22nd International Conference on Developments in Language Theory (DLT 2018), Sep 2018, Tokyo, Japan
Communication dans un congrès
hal-02083326v1
|
|
|
Polishness of Some Topologies Related to Automata 26th EACSL Annual Conference on Computer Science and Logic (CSL 2017), Aug 2017, Stockholm, Sweden. pp.22:1-22:16, ⟨10.4230/LIPIcs.CSL.2017.22⟩
Communication dans un congrès
hal-01590185v1
|
|
Two-Way Two-Tape AutomataDevelopments in Language Theory - 21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159
Communication dans un congrès
hal-02112626v1
|
|
Continuity and Rational FunctionsThe 44th International Colloquium on Automata, Languages, and Programming ICALP 2017, 2017, Varsovie, Poland. pp.1 - 11514, ⟨10.4230/LIPIcs.ICALP.2017.115⟩
Communication dans un congrès
hal-01587614v1
|
Channel Synthesis Revisited8th International Conference on Languages and Automata Theory and Applications -- LATA, Mar 2014, Madrid, Spain. pp.149-160, ⟨10.1007/978-3-319-04921-2_12⟩
Communication dans un congrès
hal-01215226v1
|
|
|
Regular Languages of Words over Countable Linear OrderingsProceedings of ICALP 2011, 2011, Zurich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-22012-8_9⟩
Communication dans un congrès
hal-00717752v1
|
Algebraic Characterization of FO for Scattered Linear Orderings25th International Workshop of Computer Science Logic (CSL), part of 20th Annual Conference of the EACSL, 2011, Unknown, Unknown Region. pp.67--81, ⟨10.4230/LIPIcs.CSL.2011.67⟩
Communication dans un congrès
hal-01215407v1
|
|
Regular Languages of Words over Countable Linear OrderingsIcalp 2011, Jul 2011, Zürich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-21254-3_1⟩
Communication dans un congrès
hal-00439263v1
|
|
Logic and Rational Languages of Words Indexed by Linear Orderings3rd International Computer Science Symposium in Russia (CSR'08), Jun 2008, Moscow, Russia, Russia. pp.76-85
Communication dans un congrès
hal-00620148v1
|
|
|
Hopcroft's automaton minimization algorithm and Sturmian wordsFifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.351-362, ⟨10.46298/dmtcs.3576⟩
Communication dans un congrès
hal-01194663v1
|
|
A first investigation of sturmian treesA first investigation of sturmian trees, Feb 2007, Aachen (Aix la Chapelle), Germany. pp.73-84, ⟨10.1007/978-3-540-70918-3_7⟩
Communication dans un congrès
hal-00150178v1
|
|
The growth ratio of synchronous rational relations is uniqueDevelopements in Language Theory, 2006, Santa Barbara, United States. pp.270-279
Communication dans un congrès
hal-00162499v1
|
A Kleene Theorem for Languages of Words Indexed by Linear Orderings2005, pp.158-167
Communication dans un congrès
hal-00091579v1
|
|
|
Complementation of Rational Sets on Scattered Linear Orderings8th International Conference on Developments in Language Theory (DLT 2004), 2004, France. pp.381-392
Communication dans un congrès
hal-00620119v1
|
On the complexity of Hopcroft's state minimization algorithm9th International Conference on Implementation and Application of Automata (CIAA 2004), Jul 2004, Kingston, Canada, Canada. pp.35-44
Communication dans un congrès
hal-00619888v1
|
|
|
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank6th Latin American Theoretical INformatics (LATIN'04), Apr 2004, Buenos Aires, Argentina, Argentina. pp.292-301
Communication dans un congrès
hal-00619905v1
|
Unambiguous automata on bi-infinite wordsInternational Symposium on Mathematical Foundations of Computer Science 2003, 2003, Czech Republic. pp.308-317
Communication dans un congrès
hal-00619904v1
|
|
|
Operations preserving recognizable languagesFCT'03, 2003, Malmo, Sweden. pp.343-354, ⟨10.1007/978-3-540-45077-1_32⟩
Communication dans un congrès
hal-00112814v1
|
|
Determinization of transducers over infinite words27thInternational Colloquium on Automata, Languages and Programming (ICALP 2000), 2000, Switzerland. pp.561-570
Communication dans un congrès
hal-00619850v1
|
Squaring transducers: An efficient procedure for deciding functionality and sequentiality4th Latin American Theoretical INformatics (LATIN'2000), Apr 2000, Punta del Este, Uruguay, Uruguay. pp.407-416
Communication dans un congrès
hal-00619851v1
|
|
An Eilenberg theorem for words on countable ordinals3rd Latin American Theoretical INformatics (LATIN'1998), Apr 1998, Campinas, Brazil, Brazil. pp.53-64
Communication dans un congrès
hal-00619872v1
|
|
|
Cyclic languages and strongly cyclic languagesInternational Symposium on Theoretical Aspects of Computer Science (STACS 96), 1996, Grenoble, France. pp.49-59
Communication dans un congrès
hal-00619852v1
|
Deterministic Regular Functions of Infinite WordsICALP 2023, 261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp.121:1--121:18, 2023, ⟨10.4230/LIPIcs.ICALP.2023.121⟩
Proceedings/Recueil des communications
hal-04405111v1
|
|
Channel synthesis revisited[Research Report] lip6.2013.001, LIP6. 2013
Rapport
hal-02545987v1
|
|
Languages recognized by finite supersoluble groups2007
Pré-publication, Document de travail
hal-00143945v1
|
Minimization of AutomataJean-Éric Pin. Handbook of Automata Theory, 1, European Mathematical Society, pp.337-373, 2021, ⟨10.4171/AUTOMATA-1/10⟩
Chapitre d'ouvrage
hal-01743468v1
|
|
|
Automata and semigroups recognizing infinite wordsJ. Flum, E. Grädel and T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.585-596, 2007
Chapitre d'ouvrage
hal-00340797v1
|
Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. ProceedingsSpringer, 7907, pp.460, 2013, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-38771-5⟩
Ouvrages
hal-00843760v1
|