423 search results - page 64 / 85 » The Generalization of Generalized Automata: Expression Autom... |
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
ENTCS
2006
13 years 8 months ago
2006
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
FGCS
2006
13 years 8 months ago
2006
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
MST
2008
13 years 8 months ago
2008
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...