TY  - JOUR
AV  - none
SN  - 0304-3975
EP  - 189
ID  - eprints319
N2  - We define the class of the linear systems whose solution is expressible as a tuple of nondeterministic regular expressions when they are interpreted as trees of actions rather than as sets of sequences. We precisely characterize those systems that have a regular expression as "canonical" solution, and show that any regular expression can be obtained as a canonical solution of a system of the defined class.
SP  - 179
TI  - Nondeterministic regular expressions as solutions of equational systems
Y1  - 2003///
A1  - De Nicola, Rocco
A1  - Labella, Anna
UR  - http://www.sciencedirect.com/science/article/pii/S0304397502007740
JF  - Theoretical Computer Science
VL  - 302
PB  - Elsevier
IS  - 1-3
ER  -