91 search results - page 3 / 19 » Regular Expressions for Languages over Infinite Alphabets |
65
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
96
Voted
DIAGRAMS
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
217
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
69
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
81
Voted
DLT
2006
14 years 11 months ago
2006
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...