223 search results - page 26 / 45 » Construction of Tree Automata from Regular Expressions |
ICALP
2010
Springer
14 years 10 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
ACL
2000
13 years 9 months ago
2000
This paper reports the first part of a project that aims to develop a knowledge extraction and knowledge discovery system that extracts causal knowledge from textual databases. In...
XSYM
2005
Springer
14 years 1 months ago
2005
Springer
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
ESOP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
WINET
2011
13 years 2 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...