Abstract
Diverse problems ranging from many-valued logics to finite automata can be expressed as questions concerning compositions of functions over a finite domain. We develop a theory dealing with the depth and complete depth of such functions. Interconnections with synchronizable finite automata are also discussed. Many of the very basic problems turn out to be NP-hard. Also several open problems are pointed out.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
