103
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
138
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
117
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
107
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
142
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a construction for runtime monitors that check real-time properties expressed in timed LTL (TLTL). Due to D'Souza's results, TLTL can be considered a ...