Advanced Search

Obfuscation is a process that changes the code, but without any change to semantics. This process can be done on two levels. On the binary code level, where the instructions or control flow are modified, or on the source code level, where we can change only a structure of code to make it harder to read or we can make adjustments to reduce chance of successful reverse engineering.

This paper discusses $n$-island finite automata whose transition graphs can be expressed as $n$-member sequences of islands $i_1,i_2,\cdots ,i_n$, where there is a bridge leaving $i_j$ and entering $i_{j+1}$ for each $1\le j\le n-1$. It concentrates its attention on even computation defined as any sequence of moves during which these automata make the same number of moves in each of the islands. Under the assumption that these automata work only in an evenly computational way, the paper proves its main result stating that $n$-island finite automata...