B. Weiss. Subshifts of nite type and so c systems. Monatshefte fur Mathematik, 77:462-474, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Size of Power Automata - Sutner (1994) (2 citations) (Correct)
....interest are so c systems, subshifts X where cov(X ) is a regular language. A notable subclass of all so c systems are the subshifts of nite type: shifts whose cover is a nite complement language: there is a nite set F of words over such that cov(X ) F , see Weiss [20]. The proper morphisms for shift spaces are given by continuous maps that commute with the shift. By the Curtis Lyndon Hedlund theorem [9] these maps are precisely the global maps of one dimensional cellular automata. For our purposes, a (one dimensional) cellular automaton is simply a local map ....
....maps are precisely the global maps of one dimensional cellular automata. For our purposes, a (one dimensional) cellular automaton is simply a local map : w . The local map naturally extends to a global map 1 1 that we also denote by : X) i = X i w 1 : X i ) Weiss [20] showed that every so c system is the homomorphic image of a subshift of nite type. 2 By repeatedly applying the global map to the full shift 1 , we obtain a descending sequence of so c shifts. Let L t = cov( t ( 1 ) denote the corresponding regular cover languages. Clearly, all ....
B. Weiss. Subshifts of nite type and soc systems. Monatshefte fur Mathematik, 77:462-474, 1973.
Symbolic Dynamics and Finite Automata - Beal, Perrin (1999) (1 citation) (Correct)
....This problem is not yet completely solved although the latest results of Kim and Roush [35] indicate a counterexample to a long standing conjecture formulated by F. Williams [61] There are many links between symbolic dynamics and the theory of automata, as pointed out by R. Adler and B. Weiss [60]. Actually a very early reference on this connection can be found in a paper of A. Gleason published many years later [30] after a series of lectures given at the Institute for Defense Analysis in 1960. In this paper, based on notes by R. Beals and M. Spivak, methods of nite semigroups were ....
Benjamin Weiss. Subshifts of nite type and soc systems. Monats. Math., 77:462-474, 1973.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
....and ca. We can ensure that we start and end with the proper states by allowing only ]a and c] where ] is a putative blank character which lies outside the word. By mapping d to a, we recover the original set. In symbolic dynamics, homomorphisms of subshifts of nite type are called so c systems [58]. In any case, homomorphisms of f.c. languages, which we will call h(LLL) s below, are yet another way to de ne regular languages in one dimension. 1.4 Context free languages In several places, we will use context free languages, the second lowest level in the Chomsky hierarchy [23] they ....
B. Weiss, \Subshifts of nite type and soc systems." Monatsh. Math. 77 (1973) 462.
Reduced Power Automata - Sutner Computer Science (Correct)
No context found.
B. Weiss. Subshifts of nite type and so c systems. Monatshefte fur Mathematik, 77:462-474, 1973.
The Size of Power Automata - Sutner Computer Science (1994) (2 citations) (Correct)
No context found.
B. Weiss. Subshifts of nite type and so c systems. Monatshefte fur Mathematik, 77:462-474, 1973.
Linear Cellular Automata and Fischer Automata - Sutner (1997) (3 citations) (Correct)
No context found.
B. Weiss. Subshifts of nite type and so c systems. Monatshefte fur Mathematik, 77:462-474, 1973.
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