Valence automata and valence grammars

Traditionally, models of computation - both automata and grammars - are expanded by changing the model itself. Here, valence automata and grammars are presented as a different approach to extend the capabilities of the underlying models. For some special cases, answers to the usual questions of computational power and, in the case of automata, the possibility of determinization, are given.