Affiliations: Centre of Technology, University of Tartu, Liivi 2, EE2484 Tartu, Estonia. E-mail: [email protected] | Institute of Cybernetics, Akadeemia tee 21, EE0026 Tallinn, Estonia. E-mail: [email protected] | Institute of Computer Science, University of Tartu, Liivi 2, EE2484 Tartu, Estonia. E-mail: [email protected]
Note: [] Partially supported by Estonian Science Foundation grant ETF 1718.
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.
Keywords: attributed automata, language recognizers, functional specification 2 of AA, functional parsers
DOI: 10.3233/INF-1998-9106
Journal: Informatica, vol. 9, no. 1, pp. 85-105, 1998
