Title :
R70-35 Classes of Automata and Transitive Closure
Abstract :
The equivalence of the hierarchies of predicates or classes of sets is obtained. One hierarchy is given in terms of abstract machines, the other is defined in terms of the predicate calculus and involves formulas without quantifiers.
Keywords :
Asynchronous circuits; Automata; Calculus; Cities and towns; Delay; Joining processes; Signal design; Turing machines; Wires;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1970.223063
