7 search results - page 1 / 2 » Checking Emptiness of Non-Deterministic Regular Types with S... |
ENTCS
2008
13 years 4 months ago
2008
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
PLANX
2008
13 years 6 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
TCS
2010
13 years 3 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...