| 2006 |
|---|
| 43 | | Ferenc Gécseg,
Balázs Imreh:
On Asynchronous Tree Automata.
Journal of Automata, Languages and Combinatorics 11(2): 161-168 (2006) |
| 2005 |
|---|
| 42 | EE | Balázs Imreh,
Masami Ito:
On regular languages determined by nondeterministic directable automata.
Acta Cybern. 17(1): (2005) |
| 2004 |
|---|
| 41 | | Ferenc Gécseg,
Balázs Imreh:
On Definite and Nilpotent DR Tree Languages.
Journal of Automata, Languages and Combinatorics 9(1): 55-60 (2004) |
| 2003 |
|---|
| 40 | | Balázs Imreh,
Masami Ito,
Magnus Steinby:
On Commutative Directable Nondeterministic Automata.
Grammars and Automata for String Processing 2003: 141-150 |
| 39 | EE | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On directable nondeterministic trapped automata.
Acta Cybern. 16(1): 37-45 (2003) |
| 38 | | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On Monotonic Directable Nondeterministic Automata.
Journal of Automata, Languages and Combinatorics 8(3): 539-547 (2003) |
| 2002 |
|---|
| 37 | EE | Balázs Imreh:
Some Remarks on Asynchronous Automata.
Developments in Language Theory 2002: 290-296 |
| 36 | EE | Balázs Imreh:
Automaton Theory Approach for Solving Modified PNS Problems.
Acta Cybern. 15(3): 327-338 (2002) |
| 35 | | Ferenc Gécseg,
Balázs Imreh:
On Monotone Automata and Monotone Languages.
Journal of Automata, Languages and Combinatorics 7(1): 71-82 (2002) |
| 2001 |
|---|
| 34 | | Ferenc Gécseg,
Balázs Imreh:
On Isomorphic Representations of Monotone Tree and Nondeterministic Tree .
Words, Semigroups, and Transductions 2001: 141-154 |
| 33 | EE | Ferenc Gécseg,
Balázs Imreh:
On isomorphic representations of generalized definite automata.
Acta Cybern. 15(1): 33-44 (2001) |
| 2000 |
|---|
| 32 | EE | Balázs Imreh,
J. Fülöp,
Ferenc Friedler:
A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems.
Acta Cybern. 14(3): 497-501 (2000) |
| 31 | EE | Balázs Imreh,
Masami Ito,
A. Pukler:
On commutative asynchronous nondeterministic automata.
Acta Cybern. 14(4): 607-617 (2000) |
| 30 | EE | Balázs Imreh:
On the equivalence of the cube-product and the general product of automata.
Theor. Comput. Sci. 245(1): 103-113 (2000) |
| 1999 |
|---|
| 29 | | Balázs Imreh,
Masami Ito:
On Some Special Classes of Regular Languages.
Jewels are Forever 1999: 25-34 |
| 28 | EE | Balázs Imreh,
Magnus Steinby:
Directable Nondeterministic Automata.
Acta Cybern. 14(1): 105-116 (1999) |
| 27 | EE | Balázs Imreh,
Masami Ito:
A Note on the Star-Product.
Acta Cybern. 14(1): 99-104 (1999) |
| 26 | | Stojan Bogdanovic,
Miroslav Ciric,
Tatjana Petkovic,
Balázs Imreh,
Magnus Steinby:
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras.
Fundam. Inform. 38(1-2): 51-60 (1999) |
| 1998 |
|---|
| 25 | EE | Z. Blázsik,
Cs. Holló,
Balázs Imreh:
On Decision-Mappings Related to Process Network Synthesis Problem.
Acta Cybern. 13(3): 319-328 (1998) |
| 24 | EE | J. Fülöp,
Balázs Imreh,
Ferenc Friedler:
On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems.
Acta Cybern. 13(3): 329-338 (1998) |
| 23 | | Ferenc Gécseg,
Balázs Imreh,
András Pluhár:
On the Existence of Finite Isomorphically Complete Systems of Automata.
Journal of Automata, Languages and Combinatorics 3(2): 77-84 (1998) |
| 22 | EE | Ferenc Friedler,
L. T. Fan,
Balázs Imreh:
Process network synthesis: Problem definition.
Networks 31(2): 119-124 (1998) |
| 1997 |
|---|
| 21 | | Ferenc Gécseg,
Balázs Imreh:
On complete sets of tree automata.
Developments in Language Theory 1997: 37-47 |
| 20 | EE | Balázs Imreh:
On alphai-Products of Nondeterministic Tree Automata.
Acta Cybern. 13(1): 41-54 (1997) |
| 1996 |
|---|
| 19 | EE | Z. Blázsik,
Balázs Imreh:
A Note on Connection Between PNS and Set Covering Problems.
Acta Cybern. 12(3): 309-312 (1996) |
| 1995 |
|---|
| 18 | EE | Balázs Imreh:
On Isomorphic Representation of Nondeterministic Tree Automata.
Acta Cybern. 12(1): 11-22 (1995) |
| 17 | EE | Balázs Imreh,
Magnus Steinby:
Some Remarks on Directable Automata.
Acta Cybern. 12(1): 23-36 (1995) |
| 16 | EE | I. Bartalos,
T. Dudás,
Balázs Imreh:
On a Tour Construction Heuristic for the Asymmetric TSP.
Acta Cybern. 12(2): 209-216 (1995) |
| 1994 |
|---|
| 15 | EE | Balázs Imreh,
A. M. Ito:
A Note on Regular Strongly Shuffle-Closed Languages.
Acta Cybern. 11(4): 257-260 (1994) |
| 1992 |
|---|
| 14 | EE | Balázs Imreh:
On a Special Composition of Tree Automata.
Acta Cybern. 10(4): 237-242 (1992) |
| 13 | EE | Ferenc Gécseg,
Balázs Imreh:
Finite isomorphically complete systems.
Discrete Applied Mathematics 36(3): 307-311 (1992) |
| 1989 |
|---|
| 12 | | Pál Dömösi,
Zoltán Ésik,
Balázs Imreh:
On Product Hierarchies of Automata.
FCT 1989: 137-144 |
| 11 | | Ferenc Gécseg,
Balázs Imreh:
On star-product of automata.
Acta Cybern. 9(2): 167-172 (1989) |
| 10 | | János Csirik,
Balázs Imreh:
On the worst-case performance of the NkF bin-packing heuristic.
Acta Cybern. 9(2): 89-105 (1989) |
| 1988 |
|---|
| 9 | | Balázs Imreh:
A note on the generalized nui-product.
Acta Cybern. 8: 247-252 (1988) |
| 1987 |
|---|
| 8 | | Ferenc Gécseg,
Balázs Imreh:
On isomorphic metric equivalence of nui.
Acta Cybern. 8: 129-134 (1987) |
| 1985 |
|---|
| 7 | | Balázs Imreh:
On finite definite automata.
Acta Cybern. 7(1): 61-65 (1985) |
| 1983 |
|---|
| 6 | | Pál Dömösi,
Balázs Imreh:
On nui-products of automata.
Acta Cybern. 6: 149-162 (1983) |
| 1981 |
|---|
| 5 | | Zoltán Ésik,
Balázs Imreh:
Remarks on finite commutative automat.
Acta Cybern. 5: 143-146 (1981) |
| 4 | | Balázs Imreh:
On isomorphic representations of commutative automata with respect to alphai-products.
Acta Cybern. 5: 21-32 (1981) |
| 3 | | Zoltán Ésik,
Balázs Imreh:
Subdirectly irreducible commutative automata.
Acta Cybern. 5: 251-260 (1981) |
| 2 | | Balázs Imreh:
On finite nilpotent automata.
Acta Cybern. 5: 281-293 (1981) |
| 1977 |
|---|
| 1 | | Balázs Imreh:
On alphai-products of automata.
Acta Cybern. 3: 301-307 (1977) |
