23 search results - page 4 / 5 » An Implementation of Deterministic Tree Automata Minimizatio... |
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
CSR
2010
Springer
13 years 11 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
WIA
2000
Springer
13 years 12 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
ML
2007
ACM
13 years 8 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical deļ¬nitions by three speciļ¬c features. First, it does not rely on automata. Secondly, it...