Automaton theory approach for solving modified PNS problems

Balázs Imreh

Skip to main content Skip to main navigation menu Skip to site footer

Automaton theory approach for solving modified PNS problems

Balázs Imreh

Abstract

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.

Downloads

Download data is not yet available.

PDF

Published

2002-01-01

How to Cite

Imreh, B. (2002). Automaton theory approach for solving modified PNS problems. Acta Cybernetica, 15(3), 327-338. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3582

Download Citation

Issue

Vol 15 No 3 (2002)

Section

Regular articles

Most read articles by the same author(s)

János Csirik, Balázs Imreh, On the worst-case performance of the NkF bin-packing heuristic , Acta Cybernetica: Vol 9 No 2 (1989)
Ferenc Gécseg, Balázs Imreh, On star-products of automata , Acta Cybernetica: Vol 9 No 2 (1989)
Balázs Imreh, On a special composition of tree automata , Acta Cybernetica: Vol 10 No 4 (1992)
Balázs Imreh, Masami Ito, A note on regular strongly shuffle-closed languages , Acta Cybernetica: Vol 11 No 4 (1994)
Balázs Imreh, On isomorphic representation of nondeterministic tree automata , Acta Cybernetica: Vol 12 No 1 (1995)
Balázs Imreh, Magnus Steinby, Some remarks on directable automata , Acta Cybernetica: Vol 12 No 1 (1995)
István Bartalos, Tibor Dudás, Balázs Imreh, On a tour construction heuristic for the asymmetric TSP , Acta Cybernetica: Vol 12 No 2 (1995)
Zoltán Blázsik, Balázs Imreh, A note on connection between PNS and set covering problems , Acta Cybernetica: Vol 12 No 3 (1996)
Balázs Imreh, On αi-products of nondeterministic tree automata , Acta Cybernetica: Vol 13 No 1 (1997)
Zoltán Blázsik, Csaba Holló, Balázs Imreh, On decision-mappings related to process network synthesis problem , Acta Cybernetica: Vol 13 No 3 (1998)

<< < 1 2 3 > >>