500 search results - page 77 / 100 » Streaming tree automata |
CPM
1999
Springer
13 years 12 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
4OR
2010
13 years 7 months ago
2010
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...