17 search results - page 2 / 4 » On the Rademacher Complexity of Weighted Automata |
CSR
2006
Springer
13 years 8 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
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...
SCP
2010
13 years 3 months ago
2010
Several scienti c bottlenecks have been identi ed in existing component-based approaches. em, we focus on the identi cation of a relevant abstraction for the component expression ...
FOSSACS
2011
Springer
12 years 8 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
VMCAI
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...