On αi-products of automata. - Balázs Imreh (Acta Cybern., 1977)

On isomorphic representations of commutative automata with respect to αi-products. - Balázs Imreh (Acta Cybern., 1980)

Remarks on finite commutative automata. - Zoltán Ésik; Balázs Imreh (Acta Cybern., 1981)

Subdirectly irreducible commutative automata. - Zoltán Ésik; Balázs Imreh (Acta Cybern., 1981)

On finite nilpotent automata. - Balázs Imreh (Acta Cybern., 1981)

On νi-products of automata. - Pál Dömösi; Balázs Imreh (Acta Cybern., 1983)

On finite definite automata. - Balázs Imreh (Acta Cybern., 1985)

On isomorphic metric equivalence of νi. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 1987)

A note on the generalized νi-product. - Balázs Imreh (Acta Cybern., 1988)

On Product Hierarchies of Automata. - Pál Dömösi; Zoltán Ésik; Balázs Imreh (FCT, 1989)

On the worst-case performance of the NkF bin-packing heuristic. - János Csirik; Balázs Imreh (Acta Cybern., 1989)

On star-products of automata. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 1989)

On a Special Composition of Tree Automata. - Balázs Imreh (Acta Cybern., 1992)

Finite isomorphically complete systems. - Ferenc Gécseg; Balázs Imreh (Discret. Appl. Math., 1992)

A Note on Regular Strongly Shuffle-Closed Languages. - Balázs Imreh; A. M. Ito (Acta Cybern., 1994)

On a Tour Construction Heuristic for the Asymmetric TSP. - I. Bartalos; T. Dudás; Balázs Imreh (Acta Cybern., 1995)

On Isomorphic Representation of Nondeterministic Tree Automata. - Balázs Imreh (Acta Cybern., 1995)

Some Remarks on Directable Automata. - Balázs Imreh; Magnus Steinby (Acta Cybern., 1995)

On Shuffle Closure of Commutative Regular Languages. - Balázs Imreh; Masami Ito; Masashi Katsura (DMTCS, 1996)

A Note on Connection Between PNS and Set Covering Problems. - Zoltán Blázsik; Balázs Imreh (Acta Cybern., 1996)

On complete sets of tree automata. - Ferenc Gécseg; Balázs Imreh (Developments in Language Theory, 1997)

On alphai-Products of Nondeterministic Tree Automata. - Balázs Imreh (Acta Cybern., 1997)

On Decision-Mappings Related to Process Network Synthesis Problem. - Zoltán Blázsik; Cs. Holló; Balázs Imreh (Acta Cybern., 1998)

On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems. - János Fülöp; Balázs Imreh; Ferenc Friedler (Acta Cybern., 1998)

On the Existence of Finite Isomorphically Complete Systems of Automata. - Ferenc Gécseg; Balázs Imreh; András Pluhár (J. Autom. Lang. Comb., 1998)

Process network synthesis: Problem definition. - Ferenc Friedler; L. T. Fan 001; Balázs Imreh (Networks, 1998)

On Some Special Classes of Regular Languages. - Balázs Imreh; Masami Ito (Jewels are Forever, 1999)

A Note on the Star-Product. - Balázs Imreh; Masami Ito (Acta Cybern., 1999)

Directable Nondeterministic Automata. - Balázs Imreh; Magnus Steinby (Acta Cybern., 1999)

Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras. - Stojan Bogdanovic; Miroslav Ciric 001; Tatjana Petkovic; Balázs Imreh; Magnus Steinby (Fundam. Informaticae, 1999)

On Commutative Asynchronous Automata. - Balázs Imreh; Masami Ito; Antal Pukler (Words, Languages & Combinatorics, 2000)

A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems. - Balázs Imreh; János Fülöp; Ferenc Friedler (Acta Cybern., 2000)

On commutative asynchronous nondeterministic automata. - Balázs Imreh; Masami Ito; Antal Pukler (Acta Cybern., 2000)

On the equivalence of the cube-product and the general product of automata. - Balázs Imreh (Theor. Comput. Sci., 2000)

On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . - Ferenc Gécseg; Balázs Imreh (Words, Semigroups, and Transductions, 2001)

On isomorphic representations of generalized definite automata. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 2001)

Some Remarks on Asynchronous Automata. - Balázs Imreh (Developments in Language Theory, 2002)

Automaton Theory Approach for Solving Modified PNS Problems. - Balázs Imreh (Acta Cybern., 2002)

On Monotone Automata and Monotone Languages. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2002)

On Commutative Directable Nondeterministic Automata. - Balázs Imreh; Masami Ito; Magnus Steinby (Grammars and Automata for String Processing, 2003)

On directable nondeterministic trapped automata. - Balázs Imreh; Csanád Imreh; Masami Ito (Acta Cybern., 2003)

On Monotonic Directable Nondeterministic Automata. - Balázs Imreh; Csanád Imreh; Masami Ito (J. Autom. Lang. Comb., 2003)

On Definite and Nilpotent DR Tree Languages. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2004)

On regular languages determined by nondeterministic directable automata. - Balázs Imreh; Masami Ito (Acta Cybern., 2005)

On Asynchronous Tree Automata. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2006)