| M. Nivat, A. Saoudi and V. R. Dare. Parallel generation of finite images. International Journal of Pattern Recognition and Artificial Intelligence, Vol. 3, No. 3 & 4, pages 279--294, 1989. |
....2 identified to a conventional automaton when restricted to one row (or one column) pictures. Moreover, the family of picture languages recognized by this model of automaton satisfy many important properties. Different systems to generate pictures using grammars have been also explored (cf. [31, 32, 33, 35, 34, 36, 29, 30, 39]) However, in the finite state case, this approach is shown to be less powerful than others. Another possible generalization is to describe picture languages by logic formulas. Recently, W. Thomas gave a general formalism to describe graphs (and, in particular, pictures) as model theoretical ....
....languages are not related by inclusion relations. In fact in [18] there are examples of picture languages recognized by a DFA and not recognized by any 2DOTA and vice versa. 5 Grammars Different systems for generating pictures using grammars have been explored in the literature (cf. for example, [31, 32, 33, 35, 34, 36, 29, 30, 39]) We consider here models that consist of two sets of rewriting rules: horizontal and vertical rules, respectively, that correspond either to a context free or regular (conventional) grammars. These models operate by first generating a (horizontal) string oe using the horizontal rules; then ....
[Article contains additional citation context not shown here]
M. Nivat, A. Saoudi and V. R. Dare. Parallel generation of finite images. International Journal of Pattern Recognition and Artificial Intelligence, Vol. 3, No. 3 & 4, pages 279--294, 1989.
....linear bounded automata. 1 Introduction A PCA array generator (called PCAAG) introduced by Morita and Ueno [3] is a parallel generating system of symbol arrays using a nondeterministic partitioned cellular automata (PCA) a kind of CA. It has some similarity with a system of array grammars [1, 5, 6, 7], because, in both systems, symbol arrays are generated from a start symbol by applying rewriting (or transition) rules repeatedly. It is a little difficult to introduce parallelism for a grammar formalism. But, a PCAAG is by nature a parallel system, and thus suited for formulating and studying ....
Nivat, M., Saoudi, A., and Dare, V.R., "Parallel generation of finite images," Int. J. Pattern Recognition and Artificial Intelligence, 3, 279--294 (1989).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC