scientific article; zbMATH DE number 3992934
[For the entire collection see Zbl 0596.00021.] In some branches of theoretical computer science we meet systems of equations whose solutions are obtained by a fixed-point technique: a) Every context-free grammar has its system. The least solution gives the languages generated by nonterminals. b) Every flowchart program has its rational system. The least solution gives the unfoldment. The interpretation of the unfoldment gives the program behaviour. c) Every recursive program has its context-free system. The least solution gives the unfoldment. The interpretation of the unfoldment gives the program behaviour. We present, in a categorical framework, the common methodology to solve such systems. For example, we define an \(\omega\)-continuous algebraic theory such that every finite system is a morphism whose iterate gives the least solution of the system.
- scientific article; zbMATH DE number 23838
- scientific article; zbMATH DE number 967337
- Iterative solution of simultaneous equations
- scientific article; zbMATH DE number 56946
- scientific article; zbMATH DE number 88927
- Iterative solution to a system of matrix equations
- Solutions of a kind of iterative equations
- On the iterative methods for solving linear systems of equations
- Weighted systems of equations
- Iterative solution to a system of matrix equations
- Solving fixed-point equations by derivation tree analysis
- scientific article; zbMATH DE number 23838 (Why is no real title available?)
- scientific article; zbMATH DE number 56946 (Why is no real title available?)
- scientific article; zbMATH DE number 2156809 (Why is no real title available?)
- scientific article; zbMATH DE number 850633 (Why is no real title available?)
- All solutions of a system of recursion equations in infinite trees and other contraction theories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720787)