Regular trees and the free iterative theory
From MaRDI portal
Publication:1169813
DOI10.1016/0022-0000(79)90032-1zbMath0495.68042OpenAlexW1984467134MaRDI QIDQ1169813
Publication date: 1979
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(79)90032-1
decision problems involving flowchart schemesElgot's iterative algebraic theoriesequationally defined treesfixed point models for iterationfree iterative theory
Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)
Related Items (29)
On flowchart theories. I. The deterministic case ⋮ Algebraic solutions to recursion schemes ⋮ Unnamed Item ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Recursive Program Schemes and Context-Free Monads ⋮ Iterative and recursive matrix theories ⋮ How iterative reflections of monads are constructed ⋮ The equational logic of fixed points ⋮ Equational properties of iterative monads ⋮ Base modules for parametrized iterativity ⋮ Recursion-closed algebraic theories ⋮ On second-order iterative monads ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ Finiteness and rational sequences, constructively ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Algebras with parametrized iterativity ⋮ Iterative reflections of monads ⋮ Terminal coalgebras and free iterative theories ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ A Description of Iterative Reflections of Monads (Extended Abstract) ⋮ Bases for parametrized iterativity ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ The solutions of two star-height problems for regular trees ⋮ Iterative factor algebras and induced metrics ⋮ Extensions of iterative congruences of free iterative algebras ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees ⋮ Deterministic and nondeterministic flowchart interpretations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence and construction of free iterative theories
- Scalar and vector iteration
- Structured Programming With and Without go to Statements
- Initial Algebra Semantics and Continuous Algebras
- Automata in general algebras
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A Perspective View of Discrete Automata and Their Design
This page was built for publication: Regular trees and the free iterative theory
