Accession Number:
AD0415933
Title:
PRODUCTS OF AUTOMATA AND THE PROBLEM OF COVERING,
Descriptive Note:
Corporate Author:
TECHNION - ISRAEL INST OF TECH HAIFA
Personal Author(s):
Report Date:
1963-07-01
Pagination or Media Count:
17.0
Abstract:
Convenient relational techniques for the description and study of complete or partial, finite or infinite automata is introduced. By associating with every input two binary relations an easy and concise algebraic method for the study of homomorphisms and covering of automata is obtained. Author