79 search results - page 2 / 16 » Graph Rewriting in Computational Origami |
DAC
2009
ACM
13 years 9 months ago
2009
ACM
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has a...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
FLOPS
2010
Springer
13 years 11 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
MKM
2009
Springer
13 years 11 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
RTA
2011
Springer
12 years 7 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...