eprintid: 319
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/19
datestamp: 2011-06-08 13:28:05
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-08 13:28:05
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Labella, Anna
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Nondeterministic regular expressions as solutions of equational systems
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
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.
date: 2003
date_type: published
publication: Theoretical Computer Science
volume: 302
number: 1-3
publisher: Elsevier
pagerange: 179-189
id_number: 10.1016/S0304-3975(02)00774-0
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/S0304397502007740
citation:   De Nicola, Rocco and Labella, Anna  Nondeterministic regular expressions as solutions of equational systems.  Theoretical Computer Science, 302 (1-3).  pp. 179-189.  ISSN 0304-3975      (2003)