Atlas home || Conferences | Abstracts | about Atlas

2nd International Conference on Symmetry and Antisymmetry in Mathematics, Formal Languages and Computer Science
June 29 - July 1, 2000
"Transylvania" University of Brasov
Brasov, Romania

Organizers
Gabriel V. Orman, Radu Paltanea, Dorin Bocu, N. Pascu, E. Popescu, O. Popescu, I. Radomir, L. Sangeorzan, M. Neagu, E. Paltanea, D. Raducanu

View Abstracts
Conference Homepage

An Algorithm for Optimal Representation of a Nondeterministic Finite Automation by a Set-Union Knapsack Problem
by
Daniela Marinescu
Transilvania University of Brasov
Coauthors: Paul Iacob, Cristina Vladarean

We present a model for optimal representation of the transition function of a nondeterministic finite automaton by using a set-union knapsack problem. That model combines the fast access of the array representation with compactness of the list structure under the condition of a limited memory space. For the resolution of the optimization problem we present a dynamic programming algorithm and an example of its using.

Date received: March 3, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caet-10.