Didier Caucal

From MaRDI portal
Revision as of 11:04, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Didier Caucal to Didier Caucal: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:685353

Available identifiers

zbMath Open caucal.didierMaRDI QIDQ685353

List of research outcomes





PublicationDate of PublicationType
Boolean algebras by length recognizability2023-08-02Paper
Bisimulation collapse and the process taxonomy2023-06-28Paper
On Cayley graphs of basic algebraic structures2020-06-11Paper
Recognizability for automata2018-11-22Paper
Shelah-Stupp’s Iteration and Muchnik’s Iteration2018-05-24Paper
Context-Free Sequences2015-01-13Paper
https://portal.mardi4nfdi.de/entity/Q31659492012-10-19Paper
https://portal.mardi4nfdi.de/entity/Q29116472012-08-31Paper
Regularity and Context-Freeness over Word Rewriting Systems2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q30869232011-03-30Paper
An elementary bisimulation decision procedure for arbitrary context-free processes2010-06-17Paper
Synchronization of Regular Automata2009-10-16Paper
Synchronization of Pushdown Automata2009-03-26Paper
Efficient Computation of Throughput Values of Context-Free Languages2008-06-10Paper
Synchronization of Grammars2008-06-05Paper
Path Algorithms on Regular Graphs2008-02-26Paper
The Kleene Equality for Graphs2007-09-05Paper
https://portal.mardi4nfdi.de/entity/Q48188352004-09-24Paper
On the transition graphs of Turing machines.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47085672003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q47085682003-06-18Paper
On infinite transition graphs having a decidable monadic theory2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45299982002-05-07Paper
An internal presentation of regular graphs by prefix-recognizable graphs2001-11-21Paper
https://portal.mardi4nfdi.de/entity/Q45082922001-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27602462001-01-01Paper
Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)1995-07-10Paper
On the regular structure of prefix rewriting1994-02-06Paper
A fast algorithm to decide on the equivalence of stateless DPDA1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40373081993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40281251993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40276211993-02-21Paper
Graphes canoniques de graphes algébriques1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843621989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37274081986-01-01Paper

Research outcomes over time

This page was built for person: Didier Caucal