102 search results - page 7 / 21 » Tile Rewriting Grammars |
ECAL
2003
Springer
13 years 12 months ago
2003
Springer
A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By ...
LDTA
2010
13 years 7 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
LOGCOM
2000
13 years 6 months ago
2000
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
PPOPP
2006
ACM
14 years 21 days ago
2006
ACM
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs i...