6 search results - page 1 / 2 » Toward a Compositional Theory of Leftist Grammars and Transf... |
91
Voted
FOSSACS
2010
Springer
15 years 5 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
91
Voted
ESSLLI
1999
Springer
15 years 3 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
106
Voted
TAGT
1998
Springer
15 years 3 months ago
1998
Springer
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically struc...
115
Voted
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
89
Voted
TCS
2010
14 years 9 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...