Informatica Logo

International Journal

Main Page
Editorial Board
Instructions to Authors
Subscription Information

Author Index
Papers in Production

INFORMATICA, 1998, Vol. 9, No. 1, 85-105
© Institute of Mathematics and Informatics, Vilnius, 1998

ISSN 0868-4952

Models of Attributed Automata

Merik MERISTEa, Jaan PENJAMb, Varmo VENEc

aCentre of Technology, University of Tartu, Liivi 2, EE2484 Tartu, Estonia E-mail:

bInstitute of Cybernetics, Akadeemia tee 21, EE0026 Tallinn, Estonia E-mail:

cInstitute of Computer Science, University of Tartu, Liivi 2, EE2484 Tartu, Estonia E-mail:


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 extendeble for different kind of attributed automata.


attributed automata
language recognizers
functional specification 2 of AA
functional parsers

To preview Lithuanian abstract see full article text

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe

TopTop Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010