IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory: Papers Presented at the Ninth Annual Symposium, Schenectady, New York, October 15-18, 1968
Order Department, IEEE, 1968 - Automata - 448 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Characterization of Sane Asynchronous State Assignments
21 other sections not shown
5-cells algorithm alphabet arbitrary assignment asynchronous asynchronous circuits automata Automata Theory automaton B-machine binary cascade cell circuit column complete computation condition configuration construct contains context-free grammar context-free languages Corollary corresponding decoder defined Definition denote derivation deterministic e-free elements enumeration equations equivalence classes example exists finite set g-factor given grammar G graph halting problem Hence homomorphism implies integer ISCF ISCF's k-register Lemma linear linear grammar mapping matrix minterms module node obtained operator output p-cube pair parsed partition phrase problem procedure Proof pushdown list realization recursive regular expressions regular language regular program schemata result RSCF rule satisfies schema sequence sequential machine shell centers shell functions shown stack step stochastic structure sub-commands subset table languages tape symbol terminal string terminal symbol Theorem theory tion transform translation Turing machine variables vector vertices w-fac weighted context-free grammar word