The Equational Theory of Fixed Points with Applications to Generalized Language Theory

Authors:
Zoltán Ésik
Affiliations:
-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 18
Cited 2

The Kleene and the Parikh theorem in complete semirings

14th International Colloquium on Automata, languages and programming
Floyd-Hoare logic in iteration theories

Journal of the ACM (JACM)
Complete systems of B -rational identities

Theoretical Computer Science
Iteration theories of synchronization trees

Information and Computation
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Completeness of Park induction

MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Group axioms for iteration

Information and Computation
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
On Context-Free Languages

Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
On Hoare logic and Kleene algebra with tests

ACM Transactions on Computational Logic (TOCL)
Program Correctness and Matricial Iteration Theories

Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Gaußian Elimination and a Characterization of Algebraic Power Series

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Axiomatizing the Least Fixed Point Operation and Binary Supremum

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Parikh's Theorem in Commutative Kleene Algebra

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Is observational congruence on μ-expressions axiomatisable in equational Horn logic?

Information and Computation
Is observational congruence axiomatisable in equational horn logic?

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review the rudiments of the equational logic of (least) fixed points and provide some of its applications for axiomatization problems with respect to regular languages, tree languages, and synchronization trees.