Balázs Imreh

J. Autom. Lang. Comb., 2006

2005

On regular languages determined by nondeterministic directable automata.

[BibT_eX]

[DOI]

Acta Cybern., 2005

2004

On Definite and Nilpotent DR Tree Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

2003

On Monotonic Directable Nondeterministic Automata.

[BibT_eX]

[DOI]

Csanád Imreh

J. Autom. Lang. Comb., 2003

On directable nondeterministic trapped automata.

[BibT_eX]

[DOI]

Csanád Imreh

Acta Cybern., 2003

On Commutative Directable Nondeterministic Automata.

[BibT_eX]

Magnus Steinby

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

On Monotone Automata and Monotone Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

Automaton Theory Approach for Solving Modified PNS Problems.

[BibT_eX]

[DOI]

Acta Cybern., 2002

Some Remarks on Asynchronous Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

On isomorphic representations of generalized definite automata.

[BibT_eX]

[DOI]

Acta Cybern., 2001

On Isomorphic Representations of Monotone Tree and Nondeterministic Tree .

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

On the equivalence of the cube-product and the general product of automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

On commutative asynchronous nondeterministic automata.

[BibT_eX]

[DOI]

Antal Pukler

Acta Cybern., 2000

A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems.

[BibT_eX]

[DOI]

János Fülöp

Ferenc Friedler

Acta Cybern., 2000

On Commutative Asynchronous Automata.

[BibT_eX]

Antal Pukler

Proceedings of the International Colloquium on Words, 2000

1999

Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Directable Nondeterministic Automata.

[BibT_eX]

[DOI]

Magnus Steinby

Acta Cybern., 1999

A Note on the Star-Product.

[BibT_eX]

[DOI]

Acta Cybern., 1999

On Some Special Classes of Regular Languages.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Process network synthesis: Problem definition.

[BibT_eX]

[DOI]

Ferenc Friedler

L. T. Fan

Networks, 1998

On the Existence of Finite Isomorphically Complete Systems of Automata.

[BibT_eX]

[DOI]

András Pluhár

J. Autom. Lang. Comb., 1998

On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems.

[BibT_eX]

[DOI]

János Fülöp

Ferenc Friedler

Acta Cybern., 1998

On Decision-Mappings Related to Process Network Synthesis Problem.

[BibT_eX]

[DOI]

Zoltán Blázsik

Cs. Holló

Acta Cybern., 1998

1997

On alphai-Products of Nondeterministic Tree Automata.

[BibT_eX]

[DOI]

Acta Cybern., 1997

On complete sets of tree automata.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

A Note on Connection Between PNS and Set Covering Problems.

[BibT_eX]

[DOI]

Zoltán Blázsik

Acta Cybern., 1996

On Shuffle Closure of Commutative Regular Languages.

[BibT_eX]

Masashi Katsura

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Some Remarks on Directable Automata.

[BibT_eX]

[DOI]

Magnus Steinby

Acta Cybern., 1995

On Isomorphic Representation of Nondeterministic Tree Automata.

[BibT_eX]

[DOI]

Acta Cybern., 1995

On a Tour Construction Heuristic for the Asymmetric TSP.

[BibT_eX]

[DOI]

I. Bartalos

T. Dudás

Acta Cybern., 1995

1994

A Note on Regular Strongly Shuffle-Closed Languages.

[BibT_eX]

[DOI]

A. M. Ito

Acta Cybern., 1994

1992

Finite isomorphically complete systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

On a Special Composition of Tree Automata.

[BibT_eX]

[DOI]

Acta Cybern., 1992

1989

On star-products of automata.

[BibT_eX]

[DOI]

Acta Cybern., 1989

On the worst-case performance of the NkF bin-packing heuristic.

[BibT_eX]

[DOI]

János Csirik

Acta Cybern., 1989

On Product Hierarchies of Automata.

[BibT_eX]

[DOI]

Pál Dömösi

Zoltán Ésik

Proceedings of the Fundamentals of Computation Theory, 1989

1988

A note on the generalized νi-product.

[BibT_eX]

[DOI]

Acta Cybern., 1988

1987

On isomorphic metric equivalence of νi.

[BibT_eX]

[DOI]

Acta Cybern., 1987

1985

On finite definite automata.

[BibT_eX]

[DOI]

Acta Cybern., 1985

1983

On νi-products of automata.

[BibT_eX]

[DOI]

Pál Dömösi

Acta Cybern., 1983

1981

On finite nilpotent automata.

[BibT_eX]

[DOI]

Acta Cybern., 1981

Subdirectly irreducible commutative automata.

[BibT_eX]

[DOI]

Zoltán Ésik

Acta Cybern., 1981

Remarks on finite commutative automata.

[BibT_eX]

[DOI]

Zoltán Ésik

Acta Cybern., 1981

1980

On isomorphic representations of commutative automata with respect to αi-products.

[BibT_eX]

[DOI]

Acta Cybern., 1980

1977

On αi-products of automata.

[BibT_eX]

[DOI]