P.S. Wang. Sequential/Parallel matrix array languages. Journal of Cybernetics, vol. 5 pages 19--36, 1975. 42  Home/Search   Document Not in Database   Summary   Related Articles

....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]

P.S. Wang. Sequential/Parallel matrix array languages. Journal of Cybernetics, vol. 5 pages 19--36, 1975. 42

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