Automaton theory approach for solving modified PNS problems
In this paper a modified version of the Process Network Synthesis (PNS) problem is studied. By using an automaton theoretical approach, a procedure for finding an optimal solution of this modified PNS problem is presented.
Saved in:
Main Author: | Imreh Balázs |
---|---|
Format: | Article |
Published: |
2002
|
Series: | Acta cybernetica
15 No. 3 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Subjects: | |
Online Access: | http://acta.bibl.u-szeged.hu/12681 |
Similar Items
-
On some open problems of applied automaton theory and graph theory suggested by the mathematical modelling of certain neuronal networks /
by: Ádám András
Published: (1977) -
On a well-solvable class of the PNS problem
by: Blázsik Zoltán, et al.
Published: (2000) -
On the reformulation of some classes of PNS-problems as set covering problems
by: Fülöp János, et al.
Published: (1998) -
A note on connection between PNS and set covering problems
by: Blázsik Zoltán, et al.
Published: (1996) -
On the semigroup of automaton mappings with finite alphabet
by: Dömösi Pál
Published: (1972)