#### Filter Results:

#### Publication Year

2007

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivation relation of a system R ∪ D, where R is a strict subsystem of R and D is the Dyck rewriting system. From this decomposition, we deduce that the system R (resp. R −1) preserves… (More)

- Dinh Trong Hieu
- 2011

We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infinite graphs generated by deterministic graph grammars.

- ‹
- 1
- ›