Many-valued Truth Functions, Cerny''s Conjecture and Road Coloring
Alexandru Mateescu, Arto K. Salomaa · Bulletin of the European Association for Theoretical Computer Science · 1999
We investigate interconnections between many-valued truth functions and functions defined by finite deterministic automata. Propositions in one of the theory have often their natural counterpart in the other theory. Such is the case with problems about completeness, as well as with Cerny''s conjecture in automata theory. Sometimes results in one theory, such as those concerning self-conjugacy of truth functions, can be applied in the other theory.