Abstract:
We consider the problem on reconstructing the data communication protocol, on the base of the message traffic.
Formally, this problem is reduced to the problem to synthesise a grammar, given the language which it generates. We give a bound for the number of rules needed for the automaton grammar to generate a language
of the given finite cardinality.