%0 Journal Article
%@ 0304-3975
%A De Nicola, Rocco
%A Labella, Anna
%D 2003
%F eprints:319
%I Elsevier
%J Theoretical Computer Science
%N 1-3
%P 179-189
%T Nondeterministic regular expressions as solutions of equational systems
%U http://eprints.imtlucca.it/319/
%V 302
%X 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.