7 search results - page 1 / 2 » Intersection of Regular Signal-Event (Timed) Languages |
FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
FMSD
2007
13 years 4 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
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...