Sequential Machines: Selected PapersEdward F. Moore |
Contents
Acknowledgment of sources | 1 |
Finite automata and their decision problems | 63 |
The reduction of twoway automata to oneway automata | 92 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
assignment automatic device automaton b₁ B₂ behavior binary C. E. Shannon circled entries circuit condition Column computation congruence relation consider construction contains corresponding cut-point defined definition delay element delay output denotes derived designated deterministic diagram digits equations equivalence classes equivalence relation event example exists finite automata finite number flow table given graph Hartmanis Hence indicated information-lossless initial position input sequence k-tuples Kleene's lemma logical lossless matrix multiple junctions N₁ nets nondeterministic one-tape one-way automata output sequence output symbol pair paper partition possible Probabilistic automata problem proof R-sequences Rabin race conditions realization regular expression relation relay circuits result rows S-unit S₁ secondary relay sequential circuit sequential machines set of tapes signals stroke cycles stroke element switching circuit synthesis T₁ table of combinations Theorem tion transformation transition two-tape two-way automata unique variables voltage wires y₁ zero