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. (C) 2002 Elsevier Science B.V. All rights reserved.
Nondeterministic regular expressions as solutions of equational systems / Rocco De, Nicola; Labella, Anna. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 302:1-3(2003), pp. 179-189. [10.1016/s0304-3975(02)00774-0]
Nondeterministic regular expressions as solutions of equational systems
LABELLA, Anna
2003
Abstract
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. (C) 2002 Elsevier Science B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
