A Finite Axiomatization of Nondeterministic Regular Expressions-Reference-Cited by-同舟云学术

A Finite Axiomatization of Nondeterministic Regular Expressions

Published:1999-07 Issue:4-5 Volume:33 Page:447-465
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Corradini Flavio,De Nicola Rocco,Labella Anna

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:1999127/pdf

Reference35 articles.

1. An Equational Axiomatization for Multi-exit Iteration

2. Axiomatizing Prefix Iteration with Silent Steps

3. L. Aceto, W. Fokkink and A. Ingólfsdóttir, A managerie of non-finitely based process semantics over BPA*: From ready simulation to completed traces. Research Report, BRICS, RS-96-23 (1996).

4. Process algebra with a zero object

5. L. Bernatsky, S.L. Bloom, Z. Ésik and Gh. Stefanescu, Equational theories of relations and regular sets, inProc. of Words, Languages and Combinatorics, Kyoto, 1992. Word Scientific, (1994) 40-48.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Nondeterministic regular expressions as solutions of equational systems;Theoretical Computer Science;2003-06

2. Categories with sums and right distributive tensor product;Journal of Pure and Applied Algebra;2003-03

3. An Equational Axiomatization of Bisimulation over Regular Expressions;Journal of Logic and Computation;2002-04-01

4. Continuous Additive Algebras and Injective Simulations of Synchronization Trees;Journal of Logic and Computation;2002-04-01

5. Process Algebra with Recursive Operations;Handbook of Process Algebra;2001