Publications
Textbooks (in Hungarian):
- 1.
- Imreh, B., Operációkutatás, JATEPress, 1997.
- 2.
- Imreh, B., Bevezetés az operációkutatásba, JATE ÁJTK, 1998.
- 3.
- Imreh, B., Kombinatorikus Optimalizálás, NOVODAT, Gyor, 1999.
- 4.
- Bajalinov E., Imreh, B.,
Operációkutatás, POLYGON, Szeged, 2001.
Research papers in journals:
- 5.
- Imreh, B., On a theorem of G. Birkhoff, Publicationes Mathematicae 15 (1968),
147-148.
- 6.
- Imreh, B., On
and a
i-products of automata, Acta Cybernetica 3 (1978),
301-307.
- 7.
- Imreh, B., On isomorphic representations of commutative
automata with respect to
and a i-products, Acta
Cybernetica 5 (1980), 21-32.
- 8.
- Gécseg, F., B. Imreh, A note on the periodic sum of
finite automata, Foundations of Control Engineering, 5 (1980), 229-231.
- 9.
- Ésik, Z., B. Imreh, Remarks on finite commutative
automata, Acta Cybernetica 5 (1981), 143-146.
- 10.
- Ésik, Z., B. Imreh, Subdirectly irreducible commutative
automata, Acta Cybernetica 5 (1981), 251-260.
- 11.
- Imreh, B., On finite nilpotent automata, Acta Cybernetica, 5 (1981), 281-293.
- 12.
- Imreh, B., On products of automata, Papers on Automata Theory IV, K. Marx Univ. of Economics,
Dept. of Math., Budapest, 1982, No. DM 82-1, 1-15.
- 13.
- Dömösi, P., B. Imreh, On
µi-products of finite automata,
Acta Cybernetica 6 (1983), 149-162.
- 14.
- Galambos, G., B. Imreh, Egydimenziós szabási feladatok megoldása oszlopgenerálással,
Alkalmazott Matematikai Lapok 10 (1984), 73-85.
- 15.
- Imreh, B., On finite definite automata,
Acta Cybernetica 7 (1984), 61-65.
- 16.
- Imreh, B., A note on commutative involutorial
automata, Papers on Automata and Languages VI, K. Marx Univ.
of Economics, Dept. of Math., Budapest, 1984, No. DM 84-3, 1-5.
- 17.
- Gécseg, F., B. Imreh, On
and a i-products of tree automata,
Acta Cybernetica 8 (1987), 135-141.
- 18.
- Gécseg, F., B. Imreh, On metric equivalence of
µi-products,
Acta Cybernetica 8 (1987), 129-134.
- 19.
- Gécseg, F., B. Imreh, A comparison of <
and a i-products
and µi-products,
Foundations of Control Eng. 12 (1987), 1-9.
- 20.
- Imreh, B., A note on the
µ1--product,
Acta Cybernetica 8 (1988), 242-252.
- 21.
- Csirik, J., B. Imreh, On the worst-case performance of
the NkF bin-packing heuristic, Acta Cybernetica 9
(1988), 89-105.
- 22.
- Gécseg, F., B. Imreh, On star-product of automata,
Acta Cybernetica 9 (1989),43-46.
- 23.
- Gécseg, F., B. Imreh, Finite isomorphically complete
systems, Discrete Applied Mathematics 36 (1992),
307-311.
- 24.
- Imreh, B., On a special composition of tree automata,
Acta Cybernetica 10 (1992), 237-242.
- 25.
- Gécseg, F., B. Imreh, On finite isomorphically complete systems
of tree automata, Acta Sci. Math. 57 (1993), 497-502.
- 26.
- Imreh, B., M. Ito, A note on the regular strongly
shuffle-closed languages, Acta Cybernetica 11 (1994),
257-260.
- 27.
- Gécseg, F., B. Imreh, On completeness of nondeterministic
automata, Acta Math. Hungar. 68 (1995), 151-159.
- 28.
- Gécseg, F., B. Imreh, On the cube-product of
nondeterministic automata, Acta Sci.Math. (Szeged) 60 (1995), 321-327.
- 29.
- Dudás T., I. Bartalos, B. Imreh, On a tour
construction heuristic for the asymmetric TSP, Acta
Cybernetica 12 1995, 209-216.
- 30.
- Imreh, B., On isomorphic representation of
nondeterministic tree automata, Acta Cybernetica 12
(1995), 11-22.
- 31.
- Imreh, B., M. Steinby, Some Remarks on
Directable Automata, Acta Cybernetica 12 (1995),
23-36.
- 32.
- Blázsik, Z., B. Imreh, A note on connection
between PNS and set covering problems, Acta Cybernetica
12 (1996), 309-312.
- 33.
- Imreh, B., Compositions of nondeterministic
automata, RIMS Kokyuroku 960 (1996), 44-53.
- 34.
- Imreh, B., M. Ito, On
and a i-product of
nondeterministic automata, Algebra Colloquium 4
(1997), 195-202.
- 35.
- Imreh, B., On
and a i-product of
nondeterministic tree automata, Acta Cybernetica 13
(1997), 41-54.
- 36.
- Blázsik, Z., Cs. Holló, B. Imreh, On Decision-Mappings
Related to Process Network Synthesis Problem, Acta
Cybernetica 13 (1998), 319-328.
- 37.
- Fülöp J., F. Friedler, B. Imreh, On the reformulation of some
classes of PNS-problems as set covering problems, Acta
Cybernetica 13 (1998), 329-337.
- 38.
- Friedler, F., L. T. Fan, B. Imreh, Process network
synthesis: Problem definition, Networks 28 (1998),
119-124.
- 39.
- Imreh, B., G. Magyar, Empirical Analysis of Some Procedures
for Solving Process Network Synthesis Problem,
Journal of Computing and Information Technology-CIT
6 (1998), 373-382.
- 40.
- Blázsik, Z., Cs. Holló, B. Imreh, Explicit bound for
the number of feasible solutions of special PNS-problem classes,
PU.M.A 9 (1998), 17-27.
- 41.
- Gécseg, F., B. Imreh, A. Pluhár, On existence of finite
isomorphically complete systems, Journal of Automata,
Languages, and Combinatorics 3 (1998), 77-84.
- 42.
- Imreh, B., M. Steinby, Directable nondeterministic
automata, Acta Cybernetica 14 (1999), 105-115.
- 43.
- Imreh, B., M. Ito, A note on the
star-product, Acta Cybernetica 14 (1999), 99-104.
- 44.
- Bogdanovic, S., M. Ciric, B. Imreh,
T. Petkovic, M. Steinby, Traps, Extensions and Subdirect
Decomposition of Unary Algebras, Fundamenta Informatica
38, (1999), 51-60.
- 45.
- Ciric, M., B. Imreh, M. Steinby,
Subdirectly irreducible definite, reverse-definite,
and generalized definite automata, Univ. Beograd, Publ. Elektrotechn. Fak. Ser.
Mat.
10 (1999), 69-79.
- 46.
- Imreh, B., M. Ito, Nondeterministic
directable automata and related languages,
RIMS Kokyuroku 1106 (1999), 81-87.
- 47.
- Imreh, B., J. Fülöp, F. Friedler, A note on the
Equivalence of the Process Network Synthesis and Set Covering
problems, Acta Cybernetica 14 (2000), 407-502.
- 48.
- Blázsik, Z., Cs. Holló, B. Imreh, Cs. Imreh, Z.
Kovács, On a well-solvable class of the PNS problem, Novi
Sad Journal of Mathematics 30 (2000), 21-30.
- 49.
- Blázsik, Z., Cs. Holló, B. Imreh, Cs. Imreh, Z. Kovács,
On Bottleneck and k-sum version of the Process Network Synthesis
Problem, Novi Sad Journal of Mathematics 30 (2000),
11-20.
- 50.
- Imreh, B., On the equivalence of the cube-product
and the generalized product of automata, Theoretical Computer
Science 245 (2000), 103-113.
- 51.
- Bogdanovic, S., M. Ciric, B. Imreh, T. Petkovic,
Directable automata and their generalizations: a survey, Novi
Sad J. Math. 29, (1999), 29-69.
- 52.
- Imreh, B., M. Ito, A. Pukler, A note on the languages
recognized by commutative asynchronous automata, RIMS
Kokyuroku 1166 (2000), 95-99.
- 53.
- Imreh, B., M. Ito, A. Pukler, On commutative asynchronous
nondeterministic automata, Acta Cybernetica 14 (2000),
607-617.
- 54.
- Gécseg, F., B. Imreh, On isomorphic
representations of generalized definite automata, Acta
Cybernetica 15 (2001), 33-44.
- 55.
- Gécseg, F., B. Imreh, On monotone automata and
monotone languages, Journal of Automata, Languages and
Combinatorics, 7 (2002), 71-82.
- 56.
- Imreh, B., Automaton theory approach for solving
modified PNS problems, Acta Cybernetica , 15 (2002),
327-338.
- 57.
- Imreh, B., Cs. Imreh, M. Ito, On directable
nondeterministic trapped automata, Acta Cybernetica ,
16 (2003), 37-45.
- 58.
- Imreh, B., Cs. Imreh, M. Ito, On directable
nondeterministic monotonic automata, Journal of Automata,
Languages and Combinatorics , 8 (2003), 539--547.
Research papers in proceedings and edited volumes:
- 59.
- Imreh, B., Algebraicseszkie modeli vücsiszlityelnüh masin,
Second Hungarian Computer Science Conference, Preprints, 1977, 494-510.
- 60.
- Imreh, B.,
and a i--proizvogyenyij,
MTA SZTAKI Tanulmányok 137/1982, 171-179.
- 61.
- Dömösi, P., B. Imreh, On the decomposition of cellular
automata, in: Conference on System Theoretical Aspects in Computer Science, Salgótarján, 1982, 80-87.
- 62.
- Imreh, B., On completeness with respect to the quasi-direct product, in
Conference on Automata, Languages and Mathematical Systems, Salgótarján, 1984, 83-89.
- 63.
- Imreh, B., On isomorphically complete systems of finite
automata with respect to the
and a i-products, Applications of
Mathematics in Techniques, X. National School for Scientists, Proceedings, Várna, 1984, 11-15.
- 64.
- Horváth, Gy., B. Imreh, On product of tree automata, in:
Conference on Automata, Languages and Programming Systems,
Salgótarján, 1986, 129-136.
- 65.
- Gécseg, F., B. Imreh, On a special class of tree automata, in:
Conference on Automata, Languages and Programming Systems, Salgótarján, 1988.
- 66.
- Dömösi, P., Z. Ésik, B. Imreh, On product Hierarchies of automata,
Lecture Notes in Computer Science 380, FCT'89, (ed. J. Csirik, J.
Demetrovics, F. Gécseg), Springer-Verlag, Proc.,137-145.
- 67.
- Imreh, B., On complete systems of automata,
in: Proc. of the Second International Colloquium on Words,
Languages and Combinatorics, Kyoto, 1992, World Scientific
(Singapore-New Jersey-London-Hong Kong), 1994, 207-215.
- 68.
- Imreh, B., F. Friedler, L. T. Fan, An Algorithm for Improving
the Bounding Procedure in Solving Process Network Synthesis by a
Branch-and-Bound Method, in: Developments in Global
Optimization, editors: I. M. Bonze, T. Csendes, R. Horst, P. M.
Pardalos, Kluwer Academic Publisher, Dordrecht, Boston, London,
1996, 301-348.
- 69.
- Imreh, B., M. Ito, M. Katsura, On shuffle closures of commutative
regular languages, Proceedings of DMTS'96, Combinatorics,
Complexity, and Logic, (editors: D. S. Bridges, C. S. Calude, J.
Gibbsons, S. Reeves, I. H., Witten), Springer-Verlag Singapore
Pte. Ltd. , 1997, 276-288.
- 70.
- Imreh, B., On µi-products of tree automata, in:
Proceedings of LIRA'97, (eds.: R. Tosic, Z.
Budimac, Mala knjiga, Novi Sad, Yugoslavia, 1997, 77-84.
- 71.
- Gécseg, F., B. Imreh, On complete sets of tree automata, in: Proceedings
of the 3rd International Conference Developments in Language Theory, Aristotle
University of Thessaloniki, 1997, 37-47
- 72.
- Blázsik Z., Cs. Holló, B. Imreh,
Kiszámolható korlátok speciális PNS-probléma
osztályok lehetséges megoldásainak a számára,
in: Új utak a magyar operációkutatásban,
Dialóg Campus Kiadó, Budapest-Pécs, 1999, 182-194.
- 73.
- Imreh, B., M. Ito, On some special
classes of regular languages, in: Jewels are Forever (eds.:
J. Karhumaki, H. Maurer, G. Paun and G. Rozenberg,),
Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1999, 25-34.
- 74.
- Gécseg, F., B. Imreh, On isomorphic
representation of monotone tree and nondeterministic tree
automata, in: Words, Semigroups, Transductions, eds.: M.
Ito, Gh. Paun, S. Yu, World Scientific, New Yersey - London -
Singapore - Hong Kong, 2001, 141-154.
- 75.
- Imreh, B., M. Ito, M. Steinby, On commutative
directable nondeterministic automata, in: Grammars and
Automata for String Processing from Mathematics and Computer
Science to Biology and Back , eds.: Carlos Martin-Vide, Victor
Mitrana, Taylor and Francis, (Topics in Computer Mathematics),
London, 2002, 141-150.
- 76.
- Imreh, B., Some Remarks on Asynchronous
Automata, in: Proccedings of 6th International Conference,
Developments in Language Theory, eds.: M. Ito, M. Toyama, 2002.
Kyoto, Springer-Verlag, LNCS 2450 (2003), 290--296.
Studies:
- 73.
- Imreh, B., Studies on the generalized sequential machines, (Doctoral Thesis in Hungarian),1975.
- 74.
- Imreh, B., On isomorphically complete systems of finite automata (PhD Thesis, in Hungarian), 1983.