M. Blum and C. Hewitt, \Automata on a 2-dimensional tape." 8th IEEE Symp. on Switching and Automata Theory (1967) 155-160. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
....a pattern from a random initial condition, are themselves good de nitions of complexity, and not necessarily correlated with the complexity of recognizing a completed picture. 10 2. 3 Deterministic Finite Automata, or DFA s The automata in the next two sections were introduced by Blum and Hewitt [6]. The reader may consult [51] for a review. De nition. A 4 way deterministic nite state automaton, or 4 way DFA, consists of a nite set of states S, an initial state s 0 2 S, a subset S accept S, and a transition function F : A S S f ; #; g. F describes how the DFA changes its state ....
....in power. Pebbling automata. These are nite state automata that have a xed supply of pebbles, which they can pick up or deposit on sites of the input, and sense when they run across them. In one dimension, one pebble machines can only recognize regular languages, even in the alternating case [6, 16]; in two dimensions, the reader can easily show that both the NFA language of squares with a 2 in the center and the h(LLL) of strips of fa n b n g can be recognized by a one pebble DFA, and an NFA with one pebble can look for cycles in a graph. Multi head nite automata. These are nite state ....
M. Blum and C. Hewitt, \Automata on a 2-dimensional tape." 8th IEEE Symp. on Switching and Automata Theory (1967) 155-160.
New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001) (1 citation) Self-citation (Dimensional) (Correct)
....step can read a symbol of the array, change their internal state, and move up, down, left or right to a neighboring symbol. Research supported by NSF Grant CCR 97 33101 These can be deterministic, non deterministic or alternating. DFAs and NFAs of this kind were introduced by Blum and Hewitt [BH67]. Another de nition of regular language that we can generalize to two dimensions is the following. A nite complement language is one de ned by forbidding a nite number of subwords. While not every regular language is nite complement, every regular language is the image of a nite complement ....
M. Blum and C. Hewitt, \Automata on a 2-dimensional tape." 8th IEEE Symp. on Switching and Automata Theory (1967) 155-160.
Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore Self-citation (Dimensional) (Correct)
....read a symbol of the array, change their internal state, and move up, down, left or right to a neighboring symbol. These can be deterministic or non1 Research supported by NSF Grant CCR 97 33101 1 2 KARI AND MOORE deterministic, and DFAs and NFAs of this kind were introduced by Blum and Hewitt [1]. Similarly, we can forbid a finite number of subblocks and then project onto a smaller alphabet, obtaining a class of picture languages which we call homomorphisms of local lattice languages, or h(LLL)s [8] These are also called the recognizable languages [3] or the languages recognizable by ....
M. Blum and C. Hewitt (1967), Automata on a 2-dimensional tape. 8th IEEE Symp. on Switching and Automata Theory 155--160.
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