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 Fülöp, Balázs Imreh, Ferenc Friedler, On the reformulation of some classes of PNS-problems as set covering problems , Acta Cybernetica: Vol 13 No 3 (1998)
Balázs Imreh, Masami Ito, A note on the star-product , Acta Cybernetica: Vol 14 No 1 (1999)
Balázs Imreh, Magnus Steinby, Directable nondeterministic automata , Acta Cybernetica: Vol 14 No 1 (1999)
Balázs Imreh, János Fülöp, Ferenc Friedler, A note on the equivalence of the set covering and process network synthesis problems , Acta Cybernetica: Vol 14 No 3 (2000)
Balázs Imreh, Masami Ito, A. Pukler, On commutative asynchronous nondeterministic automata , Acta Cybernetica: Vol 14 No 4 (2000)
Ferenc Gécseg, Balázs Imreh, On isomorphic representations of generalized definite automata , Acta Cybernetica: Vol 15 No 1 (2001)
Balázs Imreh, Csanád Imreh, Masami Ito, On directable nondeterministic trapped automata , Acta Cybernetica: Vol 16 No 1 (2003)
Balázs Imreh, Masami Ito, On regular languages determined by nondeterministic directable automata , Acta Cybernetica: Vol 17 No 1 (2005)

<< < 1 2 3