Sciweavers

8 search results - page 1 / 2
» Formal Series of General Algebras over a Field and Their Syn...
Sort
View
BIRTHDAY
2009
Springer
13 years 11 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
Zoltán Fülöp, Magnus Steinby
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 9 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
DLT
2004
13 years 6 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
CONCUR
1998
Springer
13 years 9 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
ECCV
2008
Springer
14 years 6 months ago
Partial Difference Equations over Graphs: Morphological Processing of Arbitrary Discrete Data
Abstract. Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or a...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...