Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Caucal, Didier"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Higher order indexed monadic systems
Didier Caucal
,
Teodor Knapik
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 469-480
Synchronization of regular automata
Didier Caucal
Lecture Notes in Computer Science
5734
, 2009, pp. 2-23
Boolean algebras of unambiguous context-free languages
Didier Caucal
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
The Kleene equality for graphs
Arnaud Carayol
,
Didier Caucal
Lecture Notes in Computer Science
4162
, 2006, pp. 214-225
On infinite transition graphs having a decidable monadic theory
Didier Caucal
Theoretical Computer Science
290
(1), 2003, pp. 79-115
On the transition graphs of Turing machines
Didier Caucal
Theoretical Computer Science
296
(2), 2003, pp. 195-223
A Chomsky-like hierarchy of infinite graphs
Didier Caucal
,
Teodor Knapik
Lecture Notes in Computer Science
2420
, 2002, pp. 177-187
On infinite terms having a decidable monadic theory
Didier Caucal
Lecture Notes in Computer Science
2420
, 2002, pp. 165-176
On infinite transition graphs having a decidable monadic theory
Didier Caucal
Lecture Notes in Computer Science
1099
, 1996, pp. 194-205
An elementary bisimulation decision procedure for arbitrary context-free processes
Olaf Burkart
,
Didier Caucal
,
Bernhard Steffen
Lecture Notes in Computer Science
969
, 1995, pp. 423-433
Deciding branching bisimilarity of normed context-free processes is in
\Sigma_2^p
Didier Caucal
,
Dung T. Huynh
,
Lu Tian
Information and Computation
118
(2), 1995, pp. 306-315
Branching bisimulation for context-free processes
Didier Caucal
Lecture Notes in Computer Science
652
, 1992, pp. 316-327
On the regular structure of prefix rewriting
Didier Caucal
Theoretical Computer Science
106
, 1992, pp. 61-86
On the transition graphs of automata and grammars
Didier Caucal
,
Roland Monfort
Lecture Notes in Computer Science
484
, 1991, pp. 311-337