ATTRIBUTED MODELS OF COMPUTING
Merik Meriste, J Penjam · Proceedings of the Estonian Academy of Sciences Engineering · 1995
This paper introduces the attributed automata (AA) as a formalism for executable specification of knowledge, using regular syntax with attributes to represent contextual relations and the semantic properties of concepts.AA are treated as a generalisation of a state transition network, with attributes and computational relations attached to states and transitions, respectively.The attributed automaton model provides additional tools for the restructuring of large systems to reduce their conceptual complexity for simpler implementations.The paper discusses the general properties, composition/decomposition, and minimisation of AA.