423 search results - page 40 / 85 » The Generalization of Generalized Automata: Expression Autom... |
DLT
2004
13 years 10 months ago
2004
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...
ICDT
2010
ACM
14 years 6 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
MEDES
2009
ACM
14 years 1 months ago
2009
ACM
The main goal of web pages ranking is to find the interrelated pages. In this paper, we introduce an algorithm called FPR-DLA. In the proposed method learning automata is assigned...
CODES
2008
IEEE
13 years 10 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...