The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Digital pictures and computers are now inseparable, so it's surprising how generally unremarked their association was in the beginning. Records reveal that the first digital pictures--the first still pictures, videogames, and computer animations--were made on the earliest computers. Historians have noted this before, but individually without a unifying context. This article shows that the original...
A formal study of pattern recognition capabilities of cellular automata is undertaken based on a class of recently introduced grammars for two dimensions, the array grammars, which can be thought of as the two-dimensional generalization of context-sensitive grammars. The class of languages (patterns) generated by array grammars is shown to be precisely the class of languages accepted by cellular automata...
A set of equivalences is established among cellular automata, iterative acceptors, and linear-bounded automata. However, cellular automata are shown to be inherently faster than iterative acceptors. Many positive results are presented to indicate that the context-free languages can, perhaps, be accepted in time n and space n by cellular automata.
Cellular spaces computationally equivalent to any given Turing machine are exhibited which are simple in the sense that each cell has only a small number of states and a small neighborhood. Neighborhood reduction theorems are derived in this interest, and several simple computationuniversal cellular spaces are presented. Conditions for computation-universality of a cellular space are investigated,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.