Sciweavers

39 search results - page 3 / 8
» Timed Patterns: TCOZ to Timed Automata
Sort
View
JCSS
2007
107views more  JCSS 2007»
13 years 7 months ago
On the minimization of XML Schemas and tree automata for unranked trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
Wim Martens, Joachim Niehren
LATA
2009
Springer
14 years 2 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
BIOCOMP
2009
13 years 5 months ago
Simulating Spatial Partial Differential Equations with Cellular Automata
Abstract-- Spatial partial differential equations are commonly used to describe systems of biological entities, such as patterns created by desert vegetation and biovermiculation g...
Brian Strader, Keith E. Schubert, Ernesto Gomez, J...
JUCS
2010
161views more  JUCS 2010»
13 years 6 months ago
Evaluating Linear XPath Expressions by Pattern-Matching Automata
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
RTSS
2008
IEEE
14 years 2 months ago
A Multi-mode Real-Time Calculus
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...