2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Graphs for Core Molecular Biology
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
Nested semantics over finite trees are equationally hard
Information and Computation
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
| Hi-index | 0.02 |