Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Observational trees as models for concurrency
Mathematical Structures in Computer Science
A regular viewpoint on processes and algebra
Acta Cybernetica
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |