Solving polynomial fixed point equations-Reference-Cited by-同舟云学术

Solving polynomial fixed point equations

Published:1994 Issue: Volume: Page:52-67
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1994
language:
Short-container-title:

Author:

Bloom Stephen L.,Ésik Zoltán

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58338-6_58.pdf

Reference21 articles.

1. K. B. Arkhangelskii and P. V. Gorshkov. Implicational axioms for the algebra of regular languages (in Russian). Doklady Akad. Nauk, USSR, ser A., 10:67–69, 1987.

2. S. L. Bloom and Z. Ésik. Fixed point operations on ccc's, Part I. To appear.

3. S. L. Bloom and Z. Ésik. Some equational laws of initiality in 2ccc's. To appear.

4. S. L. Bloom and Z. Ésik. Iteration algebras. International Journal of Foundations of Computer Science, 3:245–302, 1992.

5. S. L. Bloom and Z. Ésik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics;Mathematical Structures in Computer Science;2016-10-24

2. Iteration Algebras for UnQL Graphs and Completeness for Bisimulation;Electronic Proceedings in Theoretical Computer Science;2015-09-09

3. Axiomatizing the equational theory of regular tree languages;The Journal of Logic and Algebraic Programming;2010-02

4. Categorical rewriting of term-like structures;Electronic Notes in Theoretical Computer Science;2002-05

5. Axiomatizing the equational theory of regular tree languages;STACS 98;1998