91 search results - page 8 / 19 » Regular Expressions for Languages over Infinite Alphabets |
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
ECCC
2008
13 years 7 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
AAAI
2007
13 years 9 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...