Travelled to:1 × Czech Republic
2 × USA
4 × Germany
Collaborated with:∅ D.T.Hieu J.Czyzowicz W.Fraczak W.Rytter
Talks about:rewrit (3) context (2) theori (2) system (2) monad (2) graph (2) word (2) have (2) throughput (1) synchron (1)
Person: Didier Caucal
DBLP: Caucal:Didier
Contributed to:
2011
2007
20062000
1996
1992
1990Wrote 7 papers:
- FoSSaCS-2011-CaucalH #term rewriting #word
- Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.
- CIAA-2007-CaucalCFR #context-free grammar #performance #throughput
- Efficient Computation of Throughput Values of Context-Free Languages (DC, JC, WF, WR), pp. 203–213.
- DLT-2006-Caucal #automaton
- Synchronization of Pushdown Automata (DC), pp. 120–132.
- FoSSaCS-2000-Caucal #on the #term rewriting #word
- On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.
- ICALP-1996-Caucal #decidability #graph #infinity #monad #on the
- On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
- LICS-1992-Caucal #monad #term rewriting
- Monadic Theory of Term Rewritings (DC), pp. 266–273.
- GG-1990-Caucal #graph grammar
- An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes (DC), pp. 190–206.