500 search results - page 25 / 100 » Streaming tree automata |
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
CSL
2003
Springer
14 years 25 days ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
GRAMMARS
2000
13 years 7 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...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...