Sciweavers

102 search results - page 3 / 21
» Tile Rewriting Grammars
Sort
View
140
Voted
COLING
1992
15 years 8 months ago
A Three-level Revision Model for Improving Japanese Bad-styled Expressions
This paper proposes a three-level revision model for improving badly-styled Japanese expressions, especially in the field of technical communication. The model is a mixture of the...
Yoshihiko Hayashi
227
Voted
RTA
2011
Springer
14 years 10 months ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
169
Voted
ECOOP
2004
Springer
16 years 25 days ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin
PODC
2009
ACM
16 years 8 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling
180
Voted
JOLLI
2010
106views more  JOLLI 2010»
15 years 5 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa