Equational logic of circular data type specification
Theoretical Computer Science
Category theory for computing science
Category theory for computing science
Iteration theories of synchronization trees
Information and Computation
Completeness of Park induction
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
The equational logic of fixed points
Theoretical Computer Science
Equational properties of iteration in algebraically complete categories
MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Information and Computation
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communication and Concurrency
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
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
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
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)
Rational algebraic theories and fixed-point solutions
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Axiomatizing rational power series over natural numbers
Information and Computation
Iteration Grove Theories with Applications
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Handbook of Weighted Automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.