By Topic

Networks of Automata: Some Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rosenfeld, Azriel ; Computer Science Center, University of Maryland, College Park, Md. 20742.

Parallel web automata (PWA¿a generalization of cellular arrays to arbitrary graph structures¿are defined. It is shown that such automata make poor acceptors (i.e., they are not good recognizers of their own graph structures). However, they can be used to perform parallel local pattern matching (with respect to patterns of bounded size) on themselves, so that they have potential usefulness as models for ``semantic memory.'' They can also be used to find greatest compatible sets of graph labelings subject to given local constraints; this problem arises, for example, in the analysis of scenes containing three-dimensional objects.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-5 ,  Issue: 3 )