Sciweavers

1242 search results - page 36 / 249
» The Theory of Grammar Constraints
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 11 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
DLT
2004
13 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
DLT
2004
13 years 8 months ago
On Competence in CD Grammar Systems
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
Maurice H. ter Beek, Erzsébet Csuhaj-Varj&u...