G. P. Weeg
- 1 FLECK, A.C. Structure preserving properties of certain classes of functions on automata. Computer Laboratory, Michigan State University, May 1961. (unpublished paper)Google Scholar
- 2 WEEG, G.P. Some group theoretic properties of strongly connected automata. Computer Laborato~-, Michigan State University, May 1961. (unpublished paper)Google Scholar
- 3 RAtio, M. 0. AND ScoT~, D. Finite automata and ~heir decision problems. IBM J. Res. Develop. 8 (1959), 114-125.Google Scholar
- 4 MooRr:, E. F. Gedanken experiments on sequential machines. In Automata StyMies, pp 129-153, Princeton U. Press, Princeton, New Jersey, 1956.Google Scholar
- 5 ZAsS~NnAVS, HANs. The Theory of Groups. Chelsea Publishing Co., New York, 1949.Google Scholar
Index Terms
- The Structure of an Automaton and Its Operation-Preserving Transformation Group
Recommendations
Mean-payoff automaton expressions
CONCUR'10: Proceedings of the 21st international conference on Concurrency theoryQuantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition ...
One-Dimensional Cellular Automaton Transducers
Cellular Automata and Models of ComputationThe parallel models of cellular automata and iterative arrays are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time ...
A Physically Universal Cellular Automaton
ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer ScienceSeveral cellular automata (CA) are known to be universal in the sense that one can simulate arbitrary computations (e.g., circuits or Turing machines) by carefully encoding the computational device and its input into the cells of the CA. In this paper, ...
Comments