On Automata over Finite Boolean Ring
Zixing Cai · Journal of Chinese Computer Systems · 2006
As the foundational theory of computer science,automata theory has a direct influence on computer science and technology.This paper presents a kind of down-oriented-tree automata and a kind of directed-cycle automata over finite Boolean ring.It is proved that a kind of inverse autonomous automata has the same graph as its affined autonomous automataover finite Boolean ring.