234 search results - page 36 / 47 » On Quasi-Products of Tree Automata |
LATA
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
109
click to vote
LATA
2010
Springer
15 years 7 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
124
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
117
click to vote
DKE
2007
15 years 1 months ago
2007
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
118
click to vote
GRAMMARS
2000
15 years 1 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...