The expressive power of the bounded-iteration construct
From MaRDI portal
Publication:1186517
DOI10.1007/BF01178680zbMath0741.68040MaRDI QIDQ1186517
Publication date: 28 June 1992
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (3)
The expressiveness of a family of finite set languages ⋮ Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model ⋮ Verifiable properties of database transactions
Cites Work
This page was built for publication: The expressive power of the bounded-iteration construct