DocumentCode
1106127
Title
R70-35 Classes of Automata and Transitive Closure
Author
Tsichritzis, D.
Issue
9
fYear
1970
Firstpage
858
Lastpage
859
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1970.223063
Filename
1671656
Link To Document