The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Olivier Finkel
    Borel Ranks and Wadge Degrees of Context Free omega-Languages. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:129-138 [Conf]
  2. Olivier Finkel
    An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:369-383 [Conf]
  3. Olivier Finkel
    On Infinitary Rational Relations and Borel Sets. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:155-167 [Conf]
  4. Olivier Finkel
    Undecidable Problems About Timed Automata. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:187-199 [Conf]
  5. Olivier Finkel
    On the Accepting Power of 2-Tape Büchi Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:301-312 [Conf]
  6. Olivier Finkel
    On Decision Problems for Timed Automata. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:185-190 [Journal]
  7. Olivier Finkel
    On Decidability Properties of Local Sentences. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:75-92 [Journal]
  8. Olivier Finkel
    An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:3-4, pp:333-342 [Journal]
  9. Olivier Finkel
    On Winning Conditions of High Borel Complexity in Pushdown Games. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:66, n:3, pp:277-298 [Journal]
  10. Olivier Finkel
    On Recognizable Languages Of Infinite Pictures. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:6, pp:823-840 [Journal]
  11. Olivier Finkel
    On the Topological Complexity of Infinitary Rational Relations. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:2, pp:105-113 [Journal]
  12. Olivier Finkel
    Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:2, pp:115-126 [Journal]
  13. Olivier Finkel, Jean-Pierre Ressayre
    Stretchings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:2, pp:563-585 [Journal]
  14. J. Duparc, Olivier Finkel, Jean-Pierre Ressayre
    Computer science and the fine structure of Borel sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:257, n:1-2, pp:85-105 [Journal]
  15. Olivier Finkel
    Locally finite languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:223-261 [Journal]
  16. Olivier Finkel
    Topological properties of omega context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:669-697 [Journal]
  17. Olivier Finkel
    Wadge hierarchy of omega context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:269, n:1-2, pp:283-315 [Journal]
  18. Olivier Finkel
    Borel hierarchy and omega context free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1385-1405 [Journal]
  19. Olivier Finkel
    Ambiguity in omega context free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:217-270 [Journal]
  20. Olivier Finkel
    On omega context free languages which are Borel sets of infinite rank. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:327-346 [Journal]
  21. Olivier Finkel
    Closure properties of locally finite omega-languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:322, n:1, pp:69-84 [Journal]
  22. Olivier Finkel
    On decidability properties of local sentences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:2, pp:196-211 [Journal]
  23. Olivier Finkel, Dominique Lecomte
    There Exist Some omega -Powers of Any Borel Rank. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:115-129 [Conf]
  24. Olivier Finkel
    An Example of Pi^0_3-complete Infinitary Rational Relation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  25. Dominique Lecomte, Olivier Finkel
    There Exist some Omega-Powers of Any Borel Rank [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. Olivier Finkel, Dominique Lecomte
    Classical and Effective Descriptive Complexities of omega-Powers [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  27. Topological complexity of locally finite omega -languages. [Citation Graph (, )][DBLP]


  28. Classical and effective descriptive complexities of omega-powers. [Citation Graph (, )][DBLP]


  29. On Decidability Properties of Local Sentences [Citation Graph (, )][DBLP]


  30. Borel Ranks and Wadge Degrees of Context Free Omega Languages [Citation Graph (, )][DBLP]


  31. On the Accepting Power of 2-Tape Büchi Automata [Citation Graph (, )][DBLP]


  32. Undecidable Problems About Timed Automata [Citation Graph (, )][DBLP]


  33. Topology and Ambiguity in Omega Context Free Languages [Citation Graph (, )][DBLP]


  34. On the Length of the Wadge Hierarchy of Omega Context Free Languages [Citation Graph (, )][DBLP]


  35. An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank [Citation Graph (, )][DBLP]


  36. On Infinite Real Trace Rational Languages of Maximum Topological Complexity [Citation Graph (, )][DBLP]


  37. An omega-power of a context-free language which is Borel above Delta^0_omega [Citation Graph (, )][DBLP]


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


  39. On Winning Conditions of High Borel Complexity in Pushdown Games [Citation Graph (, )][DBLP]


  40. On the Topological Complexity of Infinitary Rational Relations [Citation Graph (, )][DBLP]


  41. Closure Properties of Locally Finite Omega Languages [Citation Graph (, )][DBLP]


  42. Wadge Degrees of Infinitary Rational Relations [Citation Graph (, )][DBLP]


  43. Topological Complexity of Context-Free omega-Languages: A Survey [Citation Graph (, )][DBLP]


  44. Topological Complexity of omega-Powers : Extended Abstract [Citation Graph (, )][DBLP]


  45. Highly Undecidable Problems about Recognizability by Tiling Systems [Citation Graph (, )][DBLP]


  46. Highly Undecidable Problems For Infinite Computations [Citation Graph (, )][DBLP]


  47. On Recognizable Languages of Infinite Pictures [Citation Graph (, )][DBLP]


  48. On Decidability Properties of One-Dimensional Cellular Automata [Citation Graph (, )][DBLP]


  49. Decision Problems For Turing Machines [Citation Graph (, )][DBLP]


  50. On Recognizable Tree Languages Beyond the Borel Hierarchy [Citation Graph (, )][DBLP]


  51. The Complexity of Infinite Computations In Models of Set Theory [Citation Graph (, )][DBLP]


  52. On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity [Citation Graph (, )][DBLP]


  53. On Infinitary Rational Relations and Borel Sets [Citation Graph (, )][DBLP]


  54. On Omega Context Free Languages which are Borel Sets of Infinite Rank [Citation Graph (, )][DBLP]


  55. An Effective Extension of the Wagner Hierarchy to Blind Counter Automata [Citation Graph (, )][DBLP]


  56. The Isomorphism Relation Between Tree-Automatic Structures [Citation Graph (, )][DBLP]


Search in 0.328secs, Finished in 0.330secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002