PRODUCTS OF AUTOMATA AND THE PROBLEM OF COVERING,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1963
- Accession Number
- AD0415933
Entities
People
- Abraham Ginzburg
- Michael Yoeli
Organizations
- Technion – Israel Institute of Technology