59 search results - page 2 / 12 » Simulations of Weighted Tree Automata |
RP
2009
Springer
13 years 11 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
ACTA
2004
13 years 4 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
FSMNLP
2009
Springer
13 years 2 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
JLP
2010
12 years 11 months ago
2010
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...