Sciweavers

500 search results - page 11 / 100
» Streaming tree automata
Sort
View
WIA
2009
Springer
14 years 2 days ago
On Extremal Cases of Hopcroft's Algorithm
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
Giusi Castiglione, Antonio Restivo, Marinella Scio...
DLT
2004
13 years 9 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
IS
2010
13 years 6 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
STACS
2007
Springer
14 years 1 months ago
A First Investigation of Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...