The following pages link to Didier Caucal (Q685353):
Displaying 34 items.
- (Q216323) (redirect page) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- Recognizability for automata (Q1622962) (← links)
- On infinite transition graphs having a decidable monadic theory (Q1853615) (← links)
- Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) (Q1892892) (← links)
- (Q2760246) (← links)
- (Q2911647) (← links)
- Context-Free Sequences (Q2938167) (← links)
- Regularity and Context-Freeness over Word Rewriting Systems (Q3000610) (← links)
- (Q3086923) (← links)
- (Q3165949) (← links)
- Synchronization of Regular Automata (Q3182910) (← links)
- Graphes canoniques de graphes algébriques (Q3479542) (← links)
- (Q3484362) (← links)
- Synchronization of Grammars (Q3503630) (← links)
- Efficient Computation of Throughput Values of Context-Free Languages (Q3503907) (← links)
- An elementary bisimulation decision procedure for arbitrary context-free processes (Q3569030) (← links)
- Synchronization of Pushdown Automata (Q3617051) (← links)
- (Q3727408) (← links)
- (Q4027621) (← links)
- (Q4028125) (← links)
- (Q4037308) (← links)
- (Q4508292) (← links)
- (Q4529998) (← links)
- Shelah-Stupp’s Iteration and Muchnik’s Iteration (Q4643216) (← links)
- (Q4708567) (← links)
- (Q4708568) (← links)
- (Q4818835) (← links)
- On Cayley graphs of basic algebraic structures (Q5113594) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
- Path Algorithms on Regular Graphs (Q5444961) (← links)
- The Kleene Equality for Graphs (Q5756721) (← links)
- An internal presentation of regular graphs by prefix-recognizable graphs (Q5949571) (← links)
