Journal:Informatica
Volume 9, Issue 1 (1998): Special Issue on Programming Theory, Information System Engineering, Software Engineering, and Artificial Intelligence, pp. 85–105
Abstract
Attributed automaton (AA) is a formalism for conceptual knowledge specification using regular syntax with attributes representing contextual relations as well as semantic properties of concepts. AA can be treated as a generalization of a finite automaton with attributes and computational relations attached to states and transitions respectively. In this paper we develop a new specification method for AA based on functional combinators. It allows modular specification of AA, enjoys good algebraic properties and is extendable for different kind of attributed automata.