default search action
Olivier Carton
Person information
- affiliation: Université de Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j46]Olivier Carton, Sylvain Perifel:
Deterministic pushdown automata can compress some normal sequences. Log. Methods Comput. Sci. 20(3) (2024) - [j45]Verónica Becher
, Olivier Carton
Nested Perfect Arrays. IEEE Trans. Inf. Theory 70(10): 7463-7471 (2024) - [i28]Olivier Carton, Reem Yassawi:
Mahler equations for Zeckendorf numeration. CoRR abs/2405.01953 (2024) - [i27]Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger:
Addition in Dumont-Thomas Numeration Systems in Theory and Practice. CoRR abs/2406.09868 (2024) - [i26]Verónica Becher, Olivier Carton, Santiago Figueira:
Rauzy dimension and finite-state dimension. CoRR abs/2406.18383 (2024) - 2023
- [c43]Olivier Carton
Deterministic Regular Functions of Infinite Words. ICALP 2023: 121:1-121:18 - [i25]Verónica Becher, Olivier Carton:
Nested perfect toroidal arrays. CoRR abs/2301.00633 (2023) - [i24]Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter:
Deterministic regular functions of infinite words. CoRR abs/2302.06672 (2023) - 2022
- [j44]Olivier Carton, Elisa Orduna:
Preservation of normality by transducers. Inf. Comput. 282: 104650 (2022) - [c42]Olivier Carton
Preservation of Normality by Unambiguous Transducers. DLT 2022: 90-101 - [c41]Olivier Carton:
Ambiguity Through the Lens of Measure Theory. FSTTCS 2022: 34:1-34:14 - [c40]Olivier Carton
Continuous Rational Functions Are Deterministic Regular. MFCS 2022: 28:1-28:13 - [i23]Olivier Carton, Gaëtan Douéneau-Tabot:
Continuous rational functions are deterministic regular. CoRR abs/2204.11235 (2022) - [i22]Olivier Carton, Sylvain Perifel:
Deterministic pushdown automata can compress some normal sequences. CoRR abs/2205.00734 (2022) - 2021
- [j43]Olivier Carton, Joseph Vandehey:
Preservation of Normality by Non-Oblivious Group Selection. Theory Comput. Syst. 65(2): 241-256 (2021) - [p1]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimisation of automata. Handbook of Automata Theory (I.) 2021: 337-373 - [i21]Olivier Carton, Luc Dartois:
Aperiodic two-way transducers and FO-transductions. CoRR abs/2103.15651 (2021) - 2020
- [j42]Michaël Cadilhac
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16(1) (2020) - [j41]Olivier Carton, Luc Boasson:
Transfinite Lyndon words. Log. Methods Comput. Sci. 16(4) (2020) - [j40]Nicolás Alvarez, Olivier Carton
On Normality in Shifts of Finite Type. Theory Comput. Syst. 64(5): 783-798 (2020) - [i20]Olivier Carton:
A direct proof of Agafonov's theorem and an extension to shift of finite type. CoRR abs/2005.00255 (2020) - [i19]Olivier Carton:
Preservation of normality by unambiguous transducers. CoRR abs/2006.00891 (2020) - [i18]Olivier Carton:
Ambiguity through the lens of measure theory. CoRR abs/2011.10534 (2020)
2010 – 2019
- 2019
- [j39]Verónica Becher, Olivier Carton:
Normal numbers and nested perfect necklaces. J. Complex. 54 (2019) - [j38]Nicolás Alvarez, Verónica Becher
Finite-state independence and normal sequences. J. Comput. Syst. Sci. 103: 1-17 (2019) - [j37]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to word or tree automata. Log. Methods Comput. Sci. 15(2) (2019) - [i17]Verónica Becher, Olivier Carton, Ignacio Mollo Cunningham:
Low discrepancy sequences failing Poissonian pair correlations. CoRR abs/1903.02106 (2019) - [i16]Olivier Carton, Elisa Orduna:
Preservation of normality by transducers. CoRR abs/1904.09133 (2019) - [i15]Olivier Carton, Joseph Vandehey:
Preservation of normality by non-oblivious group selection. CoRR abs/1905.05801 (2019) - 2018
- [j36]Olivier Carton
An Algebraic Approach to MSO-Definability on Countable linear Orderings. J. Symb. Log. 83(3): 1147-1189 (2018) - [j35]Olivier Carton, Dominique Perrin, Jean-Éric Pin:
A survey on difference hierarchies of regular languages. Log. Methods Comput. Sci. 14(1) (2018) - [j34]Verónica Becher
Finite-State Independence. Theory Comput. Syst. 62(7): 1555-1572 (2018) - [c39]Olivier Carton
Counter Machines and Distributed Automata - A Story About Exchanging Space and Time. Automata 2018: 13-28 - [c38]Olivier Carton
Simon's Theorem for Scattered Words. DLT 2018: 182-193 - [i14]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity and Rational Functions. CoRR abs/1802.10555 (2018) - [i13]Christoph Aistleitner, Verónica Becher, Olivier Carton:
Normal numbers with digit dependencies. CoRR abs/1804.02844 (2018) - [i12]Olivier Carton, Bruno Guillon
Counter Machines and Distributed Automata: A Story about Exchanging Space and Time. CoRR abs/1804.03582 (2018) - [i11]Nicolás Alvarez, Olivier Carton:
On normality in shifts of finite type. CoRR abs/1807.07208 (2018) - [i10]Olivier Carton, Luc Boasson:
Transfinite Lyndon words. CoRR abs/1809.09033 (2018) - 2017
- [c37]Olivier Carton
Polishness of Some Topologies Related to Automata. CSL 2017: 22:1-22:16 - [c36]Olivier Carton
Two-Way Two-Tape Automata. DLT 2017: 147-159 - [c35]Michaël Cadilhac
Continuity and Rational Functions. ICALP 2017: 115:1-115:14 - [i9]Nicolás Alvarez, Verónica Becher, Olivier Carton:
Finite-state Independence and Normal Sequences. CoRR abs/1702.00320 (2017) - [i8]Olivier Carton, Thomas Colcombet
Regular Languages of Words over Countable Linear Orderings. CoRR abs/1702.05342 (2017) - [i7]Olivier Carton, Dominique Perrin, Jean-Éric Pin:
A survey on difference hierarchies of regular languages. CoRR abs/1702.08023 (2017) - [i6]Olivier Carton, Léo Exibard, Olivier Serre:
Two-way Two-tape Automata. CoRR abs/1710.00213 (2017) - [i5]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to automata (Extended version). CoRR abs/1710.04002 (2017) - 2016
- [i4]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Finite-state independence. CoRR abs/1611.03921 (2016) - 2015
- [j33]Olivier Carton
Normality and two-way automata. Inf. Comput. 241: 264-276 (2015) - [j32]Verónica Becher
Normality and automata. J. Comput. Syst. Sci. 81(8): 1592-1613 (2015) - [c34]Olivier Carton
Aperiodic Two-way Transducers and FO-Transductions. CSL 2015: 160-174 - [c33]Luc Boasson, Olivier Carton
Transfinite Lyndon Words. DLT 2015: 179-190 - [c32]Luc Boasson, Olivier Carton
Rational Selecting Relations and Selectors. LATA 2015: 716-726 - 2014
- [j31]Marie-Pierre Béal, Olivier Carton
Preface. Int. J. Found. Comput. Sci. 25(8): 933-936 (2014) - [c31]Béatrice Bérard, Olivier Carton
Channel Synthesis Revisited. LATA 2014: 149-160 - [c30]Achim Blumensath, Olivier Carton, Thomas Colcombet:
Asymptotic Monadic Second-Order Logic. MFCS (1) 2014: 87-98 - 2013
- [e1]Marie-Pierre Béal, Olivier Carton
Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings. Lecture Notes in Computer Science 7907, Springer 2013, ISBN 978-3-642-38770-8 [contents] - 2012
- [j30]Véronique Bruyère, Olivier Carton
An aperiodicity problem for multiwords. RAIRO Theor. Informatics Appl. 46(1): 33-50 (2012) - [c29]Olivier Carton
Two-Way Transducers with a Two-Way Output Tape. Developments in Language Theory 2012: 263-272 - 2011
- [j29]Sajid Zaidi, Frédéric Lamarque
Wavelength-Selective Shape Memory Alloy for Wireless Microactuation of a Bistable Curved Beam. IEEE Trans. Ind. Electron. 58(12): 5288-5295 (2011) - [c28]Alexis Bès, Olivier Carton:
Algebraic Characterization of FO for Scattered Linear Orderings. CSL 2011: 67-81 - [c27]Olivier Carton
Regular Languages of Words over Countable Linear Orderings. ICALP (2) 2011: 125-136 - 2010
- [j28]Jean Berstel, Luc Boasson, Olivier Carton
The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010) - [j27]Jean Berstel, Luc Boasson, Olivier Carton
Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010) - [j26]Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal:
Logic and Rational Languages of Words Indexed by Linear Orderings. Theory Comput. Syst. 46(4): 737-760 (2010) - [c26]Olivier Carton
Right-Sequential Functions on Infinite Words. CSR 2010: 96-106 - [i3]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimization of Automata. CoRR abs/1010.5318 (2010)
2000 – 2009
- 2009
- [j25]Véronique Bruyère, Olivier Carton
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43(2): 321-338 (2009) - [j24]Olivier Carton
Languages Recognized by Finite Supersoluble Groups. J. Autom. Lang. Comb. 14(2): 149-161 (2009) - [j23]Jean Berstel, Luc Boasson, Olivier Carton
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009) - [c25]Olivier Carton
Left and Right Synchronous Relations. Developments in Language Theory 2009: 170-182 - [i2]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Infinite words without palindrome. CoRR abs/0903.2382 (2009) - 2008
- [j22]Olivier Carton
On the continuity set of an Omega rational function. RAIRO Theor. Informatics Appl. 42(1): 183-196 (2008) - [c24]Olivier Carton, Dominique Perrin, Jean-Eric Pin:
Automata and semigroups recognizing infinite words. Logic and Automata 2008: 133-168 - [c23]Nicolas Bedon, Alexis Bès, Olivier Carton
Logic and Rational Languages of Words Indexed by Linear Orderings. CSR 2008: 76-85 - [i1]Olivier Carton, Olivier Finkel, Pierre Simonnet:
On the Continuity Set of an omega Rational Function. CoRR abs/0801.3912 (2008) - 2007
- [j21]Véronique Bruyère, Olivier Carton
Automata on linear orderings. J. Comput. Syst. Sci. 73(1): 1-24 (2007) - [j20]Olivier Carton
The growth ratio of synchronous rational relations is unique. Theor. Comput. Sci. 376(1-2): 52-59 (2007) - [j19]Olivier Carton
Complementation of rational sets on scattered linear orderings of finite rank. Theor. Comput. Sci. 382(2): 109-119 (2007) - [c22]Jean Berstel, Luc Boasson, Olivier Carton
A First Investigation of Sturmian Trees. STACS 2007: 73-84 - 2006
- [j18]Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17(3): 519-542 (2006) - [j17]Olivier Carton
Decision problems among the main subfamilies of rational relations. RAIRO Theor. Informatics Appl. 40(2): 255-275 (2006) - [j16]Jean Berstel, Luc Boasson, Olivier Carton
Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006) - [c21]Olivier Carton
The Growth Ratio of Synchronous Rational Relations Is Unique. Developments in Language Theory 2006: 270-279 - 2005
- [j15]Chloe Rispal, Olivier Carton
Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16(4): 767-786 (2005) - [j14]Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38(5): 593-621 (2005) - [c20]Alexis Bès, Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Developments in Language Theory 2005: 158-167 - 2004
- [j13]Marie-Pierre Béal, Olivier Carton
Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37(4): 483-502 (2004) - [c19]Chloe Rispal, Olivier Carton:
Complementation of Rational Sets on Countable Scattered Linear Orderings. Developments in Language Theory 2004: 381-392 - [c18]Olivier Carton, Chloe Rispal:
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. LATIN 2004: 292-301 - [c17]Jean Berstel, Olivier Carton:
On the Complexity of Hopcroft's State Minimization Algorithm. CIAA 2004: 35-44 - 2003
- [j12]Marie-Pierre Béal, Olivier Carton
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1): 45-63 (2003) - [j11]Olivier Carton
Unambiguous Büchi automata. Theor. Comput. Sci. 297(1-3): 37-81 (2003) - [c16]Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations Preserving Recognizable Languages. FCT 2003: 343-354 - [c15]Olivier Carton
Unambiguous Automata on Bi-infinite Words. MFCS 2003: 308-317 - 2002
- [j10]Olivier Carton
The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176(1): 51-65 (2002) - [j9]Marie-Pierre Béal, Olivier Carton
Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289(1): 225-251 (2002) - [c14]Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. Developments in Language Theory 2002: 103-115 - [c13]Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. IFIP TCS 2002: 107-118 - [c12]Olivier Carton
Accessibility in Automata on Scattered Linear Orderings. MFCS 2002: 155-164 - 2001
- [j8]Olivier Carton, Christian Choffrut:
Periodicity and roots of transfinite strings. RAIRO Theor. Informatics Appl. 35(6): 525-533 (2001) - [c11]Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. MFCS 2001: 236-247 - 2000
- [j7]Marie-Pierre Béal, Olivier Carton:
Asynchronous sliding block maps. RAIRO Theor. Informatics Appl. 34(2): 139-156 (2000) - [j6]Marie-Pierre Béal, Olivier Carton:
Computing the prefix of an automaton. RAIRO Theor. Informatics Appl. 34(6): 503-514 (2000) - [c10]Olivier Carton:
R-Trivial Languages of Words on Countable Ordinals. Words, Languages & Combinatorics 2000: 88-102 - [c9]Marie-Pierre Béal, Olivier Carton
Determinization of Transducers over Infinite Words. ICALP 2000: 561-570 - [c8]Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406 - [c7]Olivier Carton
Unambiguous Büchi Automata. LATIN 2000: 407-416 - [c6]Olivier Carton
The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284
1990 – 1999
- 1999
- [j5]Olivier Carton
The Wagner Hierarchy. Int. J. Algebra Comput. 9(5): 597-620 (1999) - [j4]Olivier Carton, Ramón Maceiras:
Computing the Rabin Index of a Parity Automaton. RAIRO Theor. Informatics Appl. 33(6): 495-506 (1999) - [c5]Marie-Pierre Béal, Olivier Carton
Asynchronous sliding block maps. Developments in Language Theory 1999: 47-59 - 1998
- [c4]Nicolas Bedon, Olivier Carton
An Eilenberg Theorem for Words on Countable Ordinals. LATIN 1998: 53-64 - 1997
- [j3]Olivier Carton
Chains and Superchains for ω-Rational Sets, Automata and Semigroups. Int. J. Algebra Comput. 7(6): 673-696 (1997) - [j2]Olivier Carton:
A Hierarchy of Cyclic Languages. RAIRO Theor. Informatics Appl. 31(4): 355-369 (1997) - [c3]Olivier Carton
The Wadge-Wagner Hierarchy of omega-Rational Sets. ICALP 1997: 17-35 - 1996
- [j1]Olivier Carton
Chain Automata. Theor. Comput. Sci. 161(1&2): 191-203 (1996) - [c2]Marie-Pierre Béal, Olivier Carton
Cyclic Languages and Strongly Cyclic Languages. STACS 1996: 49-59 - 1994
- [c1]Olivier Carton:
Chain Automata. IFIP Congress (1) 1994: 451-458
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: