On the Equational Definition of the Least Prefixed Point
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Greibach Normal Form in Algebraically Complete Semirings
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
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)
Iteration Grove Theories with Applications
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Completeness for flat modal fixpoint logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
Kleene theorem in partial conway theories with applications
Algebraic Foundations in Computer Science
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |