Sciweavers

644 search results - page 119 / 129
» Precedence Automata and Languages
Sort
View
ERSHOV
1989
Springer
14 years 15 days ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
ICALP
2009
Springer
14 years 8 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 8 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
ICECCS
2009
IEEE
119views Hardware» more  ICECCS 2009»
14 years 3 months ago
REMES: A Resource Model for Embedded Systems
In this paper, we introduce the model REMES for formal modeling and analysis of embedded resources such as storage, energy, communication, and computation. The model is a state-ma...
Cristina Cerschi Seceleanu, Aneta Vulgarakis, Paul...
LICS
2009
IEEE
14 years 3 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp