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

Search the dblp DataBase

Title:
Author:
Didier Caucal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Didier Caucal
    On the Regular Structure of Prefix Rewriting. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:87-102 [Conf]
  2. Olaf Burkart, Didier Caucal, Bernhard Steffen
    Bisimulation Collapse and the Process Taxonomy. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:247-262 [Conf]
  3. Didier Caucal
    Synchronization of Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:120-132 [Conf]
  4. Didier Caucal
    On Word Rewriting Systems Having a Rational Derivation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:48-62 [Conf]
  5. Didier Caucal
    Branching Bisimulation for Context-free Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:316-327 [Conf]
  6. Didier Caucal
    An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:190-206 [Conf]
  7. Didier Caucal
    On Infinite Transition Graphs Having a Decidable Monadic Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:194-205 [Conf]
  8. Didier Caucal
    Monadic Theory of Term Rewritings [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:266-273 [Conf]
  9. Didier Caucal
    On the Transition Graphs of Turing Machines. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:177-189 [Conf]
  10. Olaf Burkart, Didier Caucal, Bernhard Steffen
    An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:423-433 [Conf]
  11. Arnaud Carayol, Didier Caucal
    The Kleene Equality for Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:214-225 [Conf]
  12. Didier Caucal
    On Infinite Terms Having a Decidable Monadic Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:165-176 [Conf]
  13. Didier Caucal, Teodor Knapik
    A Chomsky-Like Hierarchy of Infinite Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:177-187 [Conf]
  14. Didier Caucal
    A Fast Algorithm to Decide on Simple Grammars Equivalence. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:66-85 [Conf]
  15. Didier Caucal
    Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:37-48 [Conf]
  16. Didier Caucal, Roland Monfort
    On the transition graphs of automata and grammars. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:311-337 [Conf]
  17. Didier Caucal, Dung T. Huynh, Lu Tian
    Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2 [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:306-315 [Journal]
  18. Didier Caucal
    Graphes canoniques de graphes algébriques. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:339-352 [Journal]
  19. Didier Caucal
    A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:1, pp:23-48 [Journal]
  20. Didier Caucal, Teodor Knapik
    An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:4, pp:299-336 [Journal]
  21. Didier Caucal
    On infinite transition graphs having a decidable monadic theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:79-115 [Journal]
  22. Didier Caucal
    On the transition graphs of turing machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:296, pp:195-223 [Journal]
  23. Didier Caucal
    On the Regular Structure of Prefix Rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:1, pp:61-86 [Journal]
  24. Didier Caucal, Dinh Trong Hieu
    Path Algorithms on Regular Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:199-212 [Conf]
  25. Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Efficient Computation of Throughput Values of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:203-213 [Conf]

  26. Synchronization of Grammars. [Citation Graph (, )][DBLP]


  27. Boolean algebras of unambiguous context-free languages. [Citation Graph (, )][DBLP]


  28. Synchronization of Regular Automata. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.302secs
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