Sciweavers

1423 search results - page 94 / 285
» Languages of Nested Trees
Sort
View
LACL
2005
Springer
15 years 5 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler
IWPC
2003
IEEE
15 years 5 months ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
FOCS
2005
IEEE
15 years 5 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
FCT
2005
Springer
15 years 5 months ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
15 years 4 months ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail