759 search results - page 49 / 152 » Overlap-Free Regular Languages |
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
100
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
DLT
2008
14 years 11 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...