default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDidier Caucal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i4]Didier Caucal, Chloé Rispal:
Synchronizable functions on integers. CoRR abs/2205.14018 (2022)
2010 – 2019
- 2019
- [j10]Didier Caucal:
Cayley graphs of basic algebraic structures. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [i3]Didier Caucal:
On Cayley graphs of basic algebraic structures. CoRR abs/1903.06521 (2019) - 2018
- [j9]Didier Caucal, Teodor Knapik:
Shelah-Stupp's Iteration and Muchnik's Iteration. Fundam. Informaticae 159(4): 327-359 (2018) - [c27]Didier Caucal, Chloé Rispal:
Boolean Algebras by Length Recognizability. Models, Mindsets, Meta 2018: 169-185 - [c26]Didier Caucal, Chloé Rispal:
Recognizability for Automata. DLT 2018: 206-218 - [i2]Didier Caucal:
On Cayley graphs of algebraic structures. CoRR abs/1803.08518 (2018) - 2016
- [i1]Didier Caucal:
Structural characterization of Cayley graphs. CoRR abs/1609.08272 (2016) - 2014
- [c25]Didier Caucal, Marion Le Gonidec:
Context-Free Sequences. ICTAC 2014: 259-276 - 2011
- [c24]Didier Caucal, Dinh Trong Hieu:
Regularity and Context-Freeness over Word Rewriting Systems. FoSSaCS 2011: 214-228 - [c23]Didier Caucal, Teodor Knapik:
Higher order indexed monadic systems. FSTTCS 2011: 469-480
2000 – 2009
- 2009
- [c22]Didier Caucal:
Synchronization of Regular Automata. MFCS 2009: 2-23 - 2008
- [j8]Didier Caucal, Anne Siegel:
Preface. RAIRO Theor. Informatics Appl. 42(3): 415 (2008) - [c21]Didier Caucal:
Deterministic graph grammars. Logic and Automata 2008: 169-250 - [c20]Didier Caucal, Stéphane Hassen:
Synchronization of Grammars. CSR 2008: 110-121 - [c19]Didier Caucal:
Boolean algebras of unambiguous context-free languages. FSTTCS 2008: 83-94 - 2007
- [c18]Didier Caucal, Dinh Trong Hieu:
Path Algorithms on Regular Graphs. FCT 2007: 199-212 - [c17]Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages. CIAA 2007: 203-213 - 2006
- [c16]Didier Caucal:
Synchronization of Pushdown Automata. Developments in Language Theory 2006: 120-132 - [c15]Arnaud Carayol, Didier Caucal:
The Kleene Equality for Graphs. MFCS 2006: 214-225 - 2003
- [j7]Didier Caucal:
On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1): 79-115 (2003) - [j6]Didier Caucal:
On the transition graphs of turing machines. Theor. Comput. Sci. 296(2): 195-223 (2003) - 2002
- [c14]Didier Caucal:
On Infinite Terms Having a Decidable Monadic Theory. MFCS 2002: 165-176 - [c13]Didier Caucal, Teodor Knapik:
A Chomsky-Like Hierarchy of Infinite Graphs. MFCS 2002: 177-187 - 2001
- [j5]Didier Caucal, Teodor Knapik:
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. Theory Comput. Syst. 34(4): 299-336 (2001) - [c12]Didier Caucal:
On the Transition Graphs of Turing Machines. MCU 2001: 177-189 - [p1]Olaf Burkart, Didier Caucal, Faron Moller
, Bernhard Steffen:
Verification on Infinite Structures. Handbook of Process Algebra 2001: 545-623 - 2000
- [c11]Didier Caucal:
On Word Rewriting Systems Having a Rational Derivation. FoSSaCS 2000: 48-62
1990 – 1999
- 1997
- [e1]Bernhard Steffen, Didier Caucal:
First International Workshop on Verification of Infinite State Systems, Infinity 1996, Università di Pisa, Pisa, Italy, August 30-31, 1996. Electronic Notes in Theoretical Computer Science 5, Elsevier 1997 [contents] - 1996
- [c10]Olaf Burkart, Didier Caucal, Bernhard Steffen:
Bisimulation Collapse and the Process Taxonomy. CONCUR 1996: 247-262 - [c9]Didier Caucal:
On Infinite Transition Graphs Having a Decidable Monadic Theory. ICALP 1996: 194-205 - 1995
- [j4]Didier Caucal, Dung T. Huynh, Lu Tian:
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2. Inf. Comput. 118(2): 306-315 (1995) - [c8]Olaf Burkart, Didier Caucal, Bernhard Steffen:
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. MFCS 1995: 423-433 - 1993
- [j3]Didier Caucal:
A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. RAIRO Theor. Informatics Appl. 27(1): 23-48 (1993) - 1992
- [j2]Didier Caucal:
On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106(1): 61-86 (1992) - [c7]Didier Caucal:
Branching Bisimulation for Context-free Processes. FSTTCS 1992: 316-327 - [c6]Didier Caucal:
Monadic Theory of Term Rewritings. LICS 1992: 266-273 - 1990
- [j1]Didier Caucal:
Graphes canoniques de graphes algébriques. RAIRO Theor. Informatics Appl. 24: 339-352 (1990) - [c5]Didier Caucal:
On the Regular Structure of Prefix Rewriting. CAAP 1990: 87-102 - [c4]Didier Caucal:
An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. Graph-Grammars and Their Application to Computer Science 1990: 190-206 - [c3]Didier Caucal, Roland Monfort:
On the transition graphs of automata and grammars. WG 1990: 311-337
1980 – 1989
- 1989
- [c2]Didier Caucal:
A Fast Algorithm to Decide on Simple Grammars Equivalence. Optimal Algorithms 1989: 66-85 - 1986
- [c1]Didier Caucal:
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. STACS 1986: 37-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
