The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Olivier Carton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marie-Pierre Béal, Olivier Carton
    Asynchronous sliding block maps. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:47-59 [Conf]
  2. Alexis Bès, Olivier Carton
    A Kleene Theorem for Languages of Words Indexed by Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:158-167 [Conf]
  3. Véronique Bruyère, Olivier Carton
    Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:103-115 [Conf]
  4. Olivier Carton
    The Growth Ratio of Synchronous Rational Relations Is Unique. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:270-279 [Conf]
  5. Chloe Rispal, Olivier Carton
    Complementation of Rational Sets on Countable Scattered Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:381-392 [Conf]
  6. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
    Operations Preserving Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:343-354 [Conf]
  7. Marie-Pierre Béal, Olivier Carton
    Determinization of Transducers over Infinite Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:561-570 [Conf]
  8. Olivier Carton, Dominique Perrin
    The Wadge-Wagner Hierarchy of omega-Rational Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:17-35 [Conf]
  9. Olivier Carton
    Chain Automata. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:451-458 [Conf]
  10. Véronique Bruyère, Olivier Carton
    Hierarchy Among Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:107-118 [Conf]
  11. Olivier Carton, Max Michel
    Unambiguous Büchi Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:407-416 [Conf]
  12. Olivier Carton, Chloe Rispal
    Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:292-301 [Conf]
  13. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
    Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:397-406 [Conf]
  14. Nicolas Bedon, Olivier Carton
    An Eilenberg Theorem for Words on Countable Ordinals. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:53-64 [Conf]
  15. Véronique Bruyère, Olivier Carton
    Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:236-247 [Conf]
  16. Olivier Carton
    Accessibility in Automata on Scattered Linear Orderings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:155-164 [Conf]
  17. Olivier Carton
    Unambiguous Automata on Bi-infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:308-317 [Conf]
  18. Olivier Carton, Wolfgang Thomas
    The Monadic Theory of Morphic Infinite Words and Generalizations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:275-284 [Conf]
  19. Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer
    Cyclic Languages and Strongly Cyclic Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:49-59 [Conf]
  20. Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
    A First Investigation of Sturmian Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:73-84 [Conf]
  21. Jean Berstel, Olivier Carton
    On the Complexity of Hopcroft's State Minimization Algorithm. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:35-44 [Conf]
  22. Olivier Carton, Wolfgang Thomas
    The Monadic Theory of Morphic Infinite Words and Generalizations. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:51-65 [Journal]
  23. Alexis Bès, Olivier Carton
    A Kleene Theorem for Languages of Words Indexed by Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:519-542 [Journal]
  24. Chloe Rispal, Olivier Carton
    Complementation of rational sets on countable scattered linear orderings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:767-786 [Journal]
  25. Marie-Pierre Béal, Olivier Carton
    Asynchronous sliding block maps. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:2, pp:139-156 [Journal]
  26. Marie-Pierre Béal, Olivier Carton
    Computing the prefix of an automaton. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:6, pp:503-514 [Journal]
  27. Olivier Carton
    A Hierarchy of Cyclic Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:4, pp:355-369 [Journal]
  28. Olivier Carton, Christian Choffrut
    Periodicity and roots of transfinite strings. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:525-533 [Journal]
  29. Olivier Carton, Ramón Maceiras
    Computing the Rabin Index of a Parity Automaton. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:6, pp:495-506 [Journal]
  30. Véronique Bruyère, Olivier Carton
    Automata on linear orderings. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:1-24 [Journal]
  31. Marie-Pierre Béal, Olivier Carton
    Determinization of Transducers over Infinite Words: The General Case. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:4, pp:483-502 [Journal]
  32. Véronique Bruyère, Olivier Carton
    Hierarchy Among Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:5, pp:593-621 [Journal]
  33. Marie-Pierre Béal, Olivier Carton
    Determinization of transducers over finite and infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:225-251 [Journal]
  34. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
    Squaring transducers: an efficient procedure for deciding functionality and sequentiality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:45-63 [Journal]
  35. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
    Operations preserving regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:405-420 [Journal]
  36. Olivier Carton
    Chain Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:191-203 [Journal]
  37. Olivier Carton, Max Michel
    Unambiguous Büchi automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:37-81 [Journal]
  38. Olivier Carton
    The growth ratio of synchronous rational relations is unique. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:52-59 [Journal]
  39. Olivier Carton, Chloe Rispal
    Complementation of rational sets on scattered linear orderings of finite rank. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:109-119 [Journal]

  40. Logic and Rational Languages of Words Indexed by Linear Orderings. [Citation Graph (, )][DBLP]


  41. Right-Sequential Functions on Infinite Words. [Citation Graph (, )][DBLP]


  42. Left and Right Synchronous Relations. [Citation Graph (, )][DBLP]


  43. On the Continuity Set of an omega Rational Function [Citation Graph (, )][DBLP]


  44. Infinite words without palindrome [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002