205 search results - page 9 / 41 » Testing the Equivalence of Regular Languages |
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
MFCS
2004
Springer
15 years 2 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
CSL
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
VL
2003
IEEE
15 years 2 months ago
2003
IEEE
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
PTS
1993
14 years 10 months ago
1993
The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-spec...