91 search results - page 9 / 19 » Regular Expressions for Languages over Infinite Alphabets |
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
ICTAC
2007
Springer
14 years 1 months ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
ICS
2009
Tsinghua U.
14 years 2 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...