A note on an expressiveness hierarchy for multi-exit iteration

Authors:
Luca Aceto;Wan Fokkink;Anna Ingólfsdóttir
Affiliations:
BRICS, Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark;CWI, Department of Software Engineering, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands;BRICS, Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark and Iceland Genomics Corporation, Snorr ...
Venue:
Information Processing Letters
Year:
2003

Citing 11
Cited 0

Process algebra

Process algebra
Complete systems of B -rational identities

Theoretical Computer Science
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
An equational axiomatization for multi-exit iteration

Information and Computation
Multiple exits from a loop without the GOTO

Communications of the ACM
On the capabilities of while, repeat, and exit statements

Communications of the ACM
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
A Congruence Theorem for Structured Operational Semantics with Predicates

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A case for teaching multi-exit loops to beginning programmers

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.89

Visualization

Abstract

Multi-exit iteration is a generalization of the standard binary Kleene star operation. The addition of this construct to Basic Process Algebra (BPA) yields a more expressive language than that obtained by augmenting BPA with the standard binary Kleene star. This note offers an expressiveness hierarchy, modulo bisimulation equivalence, for the family of multi-exit iteration operators proposed by Bergstra, Bethke and Ponse.