Declarative Approach to Implementing Automata Classes in Imperative Programming Languages

This paper proposes the approach that acts as a tradeoff between declarative and imperative approaches. The paper will inherit the ability of declaratively describing the features of automata from declarative approach. The implementation of transition logic will be inherited from imperative approach as it is imperative by its nature. Even though the described approach to implementing automata classes is declarative it is still applicable for usage in object-oriented languages with static type checking. The approach is illustrated with samples written in C# in this paper.