1423 search results - page 34 / 285 » Languages of Nested Trees |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
CC
2003
Springer
15 years 2 months ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
96
Voted
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...