On two problems of A. Salomaa. - Zoltán Ésik (Acta Cybern., 1976)

On functional tree transducers. - Zoltán Ésik (FCT, 1979)

Decidability results concerning tree transducers I. - Zoltán Ésik (Acta Cybern., 1980)

An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. - Zoltán Ésik (FCT, 1981)

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)

Decidability results concerning tree transducers II. - Zoltán Ésik (Acta Cybern., 1983)

General products and equational classes of automata. - Zoltán Ésik; Ferenc Gécseg (Acta Cybern., 1983)

Algebras of Iteration Theories. - Zoltán Ésik (J. Comput. Syst. Sci., 1983)

Some varieties of iteration theories. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1984)

On the weak equivalence of Elgot's flow-chart schemata. - Zoltán Ésik (Acta Cybern., 1985)

Axiomatizing Schemes and Their Behaviors. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1985)

Homomorphic Realizations of Automata with Compositions. - Zoltán Ésik; Pál Dömösi; Ferenc Gécseg; J. Virágh (MFCS, 1986)

Varieties and general products of top-down algebras. - Zoltán Ésik (Acta Cybern., 1986)

On products of automata with identity. - Zoltán Ésik; J. Virágh (Acta Cybern., 1986)

Complete Classes of Automata for the alpha-0-Product. - Zoltán Ésik; Pál Dömösi (Theor. Comput. Sci., 1986)

On alpha-0-Products and alpha-2-Products. - Zoltán Ésik; Ferenc Gécseg (Theor. Comput. Sci., 1986)

Loop products and loop-free products. - Zoltán Ésik (Acta Cybern., 1987)

On isomorphic realization of automata with α0-products. - Zoltán Ésik (Acta Cybern., 1987)

A note on α0* - products of aperiodic automata. - Zoltán Ésik; J. Virágh (Acta Cybern., 1987)

On a Representation of Tree Automata. - Zoltán Ésik; Ferenc Gécseg (Theor. Comput. Sci., 1987)

An Extension of the Krohn-Rhodes Decomposition of Automata. - Zoltán Ésik (IMYCS, 1988)

On the hierarchy of νi-product. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1988)

On homomorphic simulation of automata by α0-products. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1988)

Independence of the Equational Axioms for Iteration Theories. - Zoltán Ésik (J. Comput. Syst. Sci., 1988)

Varieties of Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (SIAM J. Comput., 1988)

Critical Classes for the alpha_0-Product. - Pál Dömösi; Zoltán Ésik (Theor. Comput. Sci., 1988)

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

Equational Logic of Circular Data Type Specification. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1989)

Product hierarchies of automata and homomorphic simulation. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1990)

A note on the axiomatization of iteration theories. - Zoltán Ésik (Acta Cybern., 1990)

Program Correctness and Matricial Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (MFPS, 1991)

Iteration Algebras (Extended Abstract). - Stephen L. Bloom; Zoltán Ésik (TAPSOFT, Vol.1, 1991)

A note on isomorphic simulation of automata by networks of two-state automata. - Zoltán Ésik (Discret. Appl. Math., 1991)

Cayley iff Stone. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1991)

Floyd-Hoare Logic in Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (J. ACM, 1991)

Results on Homomorphic Realization of Automata by alpha_0-Products. - Zoltán Ésik (Theor. Comput. Sci., 1991)

Iteration Algebras. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1992)

Some Quasi-Varieties of Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (MFPS, 1993)

Erratum: Iteration Algebras. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1993)

Matrix and Matricial Iteration Theories, Part I. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1993)

Matrix and Matricial Iteration Theories, Part II. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1993)

Equational Axioms for Regular Sets. - Stephen L. Bloom; Zoltán Ésik (Math. Struct. Comput. Sci., 1993)

Iteration Theories - The Equational Logic of Iterative Processes - Stephen L. Bloom; Zoltán Ésik (Springer, 1993)

Iteration Theories of Synchronization Trees - Stephen L. Bloom; Zoltán Ésik; Dirk Taubner (Inf. Comput., 1993)

Solving Polynomial Fixed Point Equations. - Stephen L. Bloom; Zoltán Ésik (MFCS, 1994)

Free Shuffle Algebras in Language Varieties (Extended Abstract). - Stephen L. Bloom; Zoltán Ésik (LATIN, 1995)

Nonfinite Axiomatizability of Shuffle Inequalities. - Stephen L. Bloom; Zoltán Ésik (TAPSOFT, 1995)

Scott induction and equational proofs. - Zoltán Ésik; L. Bernátsky (MFPS, 1995)

Some Equational Laws of Initiality in 2CCC's. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1995)

Equational Properties of Kleene Algebras of Relations with Conversion. - Zoltán Ésik; L. Bernátsky (Theor. Comput. Sci., 1995)

Two Axiomatizations of a Star Semiring Quasi-Variety. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1996)

Fixed-Point Operations on ccc's. Part I. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1996)

Free Shuffle Algebras in Language Varieties. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1996)

Iteration 2-Theories: Extended Abstract. - Stephen L. Bloom; Anna Labella; Zoltán Ésik; Ernest G. Manes (AMAST, 1997)

Axiomatizing Shuffle and Concatenation in Languages. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 1997)

Varieties Generated by Languages with Poset Operations. - Stephen L. Bloom; Zoltán Ésik (Math. Struct. Comput. Sci., 1997)

The Equational Logic of Fixed Points (Tutorial). - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1997)

Completeness of Park Induction. - Zoltán Ésik (Theor. Comput. Sci., 1997)

Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). - Zoltán Ésik (STACS, 1998)

Nonfinite Axiomatizability of the Equational Theory of Shuffle. - Zoltán Ésik; Michael Bertol (Acta Informatica, 1998)

A Cayley Theorem for Ternary Algebras. - Zoltán Ésik (Int. J. Algebra Comput., 1998)

Semantics on Flowchart Programs and the Free Conway Theories. - L. Bernátsky; Zoltán Ésik (RAIRO Theor. Informatics Appl., 1998)

Shuffle binoids. - Stephen L. Bloom; Zoltán Ésik (RAIRO Theor. Informatics Appl., 1998)

Equational Properties of Iteration in Algebraically Complete Categories. - Zoltán Ésik; Anna Labella (Theor. Comput. Sci., 1998)

Series and Parallel Operations on Pomsets. - Zoltán Ésik; Satoshi Okawa (FSTTCS, 1999)

Axiomatizing Iteration Categories. - Zoltán Ésik (Acta Cybern., 1999)

Group Axioms for Iteration. - Zoltán Ésik (Inf. Comput., 1999)

A Note on Equations for Commutative Regular Languages. - Sinisa Crvenkovic; Igor Dolinka; Zoltán Ésik (Inf. Process. Lett., 1999)

Axiomatizing the Least Fixed Point Operation and Binary Supremum. - Zoltán Ésik (CSL, 2000)

Hazard Algebras (Extended Abstract). - Janusz A. Brzozowski; Zoltán Ésik (A Half-Century of Automata Theory, 2000)

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (LATIN, 2000)

Iteration Theories of Boolean Functions. - Zoltán Ésik (MFCS, 2000)

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (STACS, 2000)

The Power of the Group-Identities for Iteration. - Zoltán Ésik (Int. J. Algebra Comput., 2000)

A Kleene Theorem for Lindenmayerian Algebraic Power Series. - Zoltán Ésik; Werner Kuich (J. Autom. Lang. Comb., 2000)

The Variety of Kleene Algebras with Conversion is not Finitely Based. - Sinisa Crvenkovic; Igor Dolinka; Zoltán Ésik (Theor. Comput. Sci., 2000)

A proof of the Krohn-Rhodes Decomposition Theorem. - Zoltán Ésik (Theor. Comput. Sci., 2000)

A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets. - Zoltán Ésik; Werner Kuich (Words, Semigroups, and Transductions, 2001)

The Equational Theory of Fixed Points with Applications to Generalized Language Theory. - Zoltán Ésik (Developments in Language Theory, 2001)

Automata on Series-Parallel Biposets. - Zoltán Ésik; Zoltán L. Németh (Developments in Language Theory, 2001)

Axiomatizing Tropical Semirings. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (FoSSaCS, 2001)

Algebras for Hazard Detection. - Janusz A. Brzozowski; Zoltán Ésik; Y. Iland (ISMVL, 2001)

Iteration 2-theories. - Stephen L. Bloom; Zoltán Ésik; Anna Labella; Ernest G. Manes (Appl. Categorical Struct., 2001)

On Equations for Union-Free Regular Languages. - Sinisa Crvenkovic; Igor Dolinka; Zoltán Ésik (Inf. Comput., 2001)

Homomorphic Simulation and Letichevsky's Criterion. - Pál Dömösi; Zoltán Ésik (J. Autom. Lang. Comb., 2001)

Equational Axioms for Probabilistic Bisimilarity. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (AMAST, 2002)

Greibach Normal Form in Algebraically Complete Semirings. - Zoltán Ésik; Hans Leiß (CSL, 2002)

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. - Zoltán Ésik (Developments in Language Theory, 2002)

Unique, guarded fixed points in an additive setting: Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (CTCS, 2002)

A Fully Equational Proof of Parikh's Theorem. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (RAIRO Theor. Informatics Appl., 2002)

Rationally Additive Semirings. - Zoltán Ésik; Werner Kuich (J. Univers. Comput. Sci., 2002)

Continuous Additive Algebras and Injective Simulations of Synchronization Trees. - Zoltán Ésik (J. Log. Comput., 2002)

Axiomatizing the subsumption and subword preorders on finite and infinite partial words. - Zoltán Ésik (Theor. Comput. Sci., 2002)

Axioms for Regular Words: Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (FSTTCS, 2003)

On Logically Defined Recognizable Tree Languages. - Zoltán Ésik; Pascal Weil (FSTTCS, 2003)

Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata. - Zoltán Ésik; Masami Ito (Acta Cybern., 2003)

Hazard Algebras. - Janusz A. Brzozowski; Zoltán Ésik (Formal Methods Syst. Des., 2003)

Deciding whether the frontier of a regular tree is scattered. - Stephen L. Bloom; Zoltán Ésik (Fundam. Informaticae, 2003)

Foreword. - Zoltán Ésik; Anna Ingólfsdóttir (RAIRO Theor. Informatics Appl., 2003)

Regular languages definable by Lindström quantifiers. - Zoltán Ésik; Kim Guldstrand Larsen (RAIRO Theor. Informatics Appl., 2003)

An Extension Theorem with an Application to Formal Tree Series. - Stephen L. Bloom; Zoltán Ésik (J. Autom. Lang. Comb., 2003)

Formal Tree Series. - Zoltán Ésik; Werner Kuich (J. Autom. Lang. Comb., 2003)

Equational theories of tropical semirings. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (Theor. Comput. Sci., 2003)

The max-plus algebra of the natural numbers has no finite equational basis. - Luca Aceto; Zoltán Ésik; Anna Ingólfsdóttir (Theor. Comput. Sci., 2003)

A Semiring-Semimodule Generalization of omega-Context-Free Languages. - Zoltán Ésik; Werner Kuich (Theory Is Forever, 2004)

An Algebraic Generalization of omega-Regular Languages. - Zoltán Ésik; Werner Kuich (MFCS, 2004)

Axiomatizing omega and omega-op powers of words. - Stephen L. Bloom; Zoltán Ésik (RAIRO Theor. Informatics Appl., 2004)

Foreword. - Zoltán Ésik; Igor Walukiewicz (RAIRO Theor. Informatics Appl., 2004)

Higher Dimensional Automata. - Zoltán Ésik; Zoltán L. Németh (J. Autom. Lang. Comb., 2004)

Foreword. - Zoltán Ésik; Zoltán Fülöp 001 (Theor. Comput. Sci., 2004)

Inductive star-semirings. - Zoltán Ésik; Werner Kuich (Theor. Comput. Sci., 2004)

Algebraically complete semirings and Greibach normal form. - Zoltán Ésik; Hans Leiß (Ann. Pure Appl. Log., 2005)

Cascade Products and Temporal Logics on Finite Trees. - Zoltán Ésik (APC 25, 2005)

The equational theory of regular words. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 2005)

Algebraic and graph-theoretic properties of infinite n-posets. - Zoltán Ésik; Zoltán L. Németh (RAIRO Theor. Informatics Appl., 2005)

A Semiring-Semimodule Generalization of ω-Regular Languages I. - Zoltán Ésik; Werner Kuich (J. Autom. Lang. Comb., 2005)

A Semiring-Semimodule Generalization of ω-Regular Languages II. - Zoltán Ésik; Werner Kuich (J. Autom. Lang. Comb., 2005)

Guest editors' foreword: Process Algebra. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Zoltán Ésik (Theor. Comput. Sci., 2005)

Algebraic recognizability of regular tree languages. - Zoltán Ésik; Pascal Weil (Theor. Comput. Sci., 2005)

Completing Categorical Algebras. - Stephen L. Bloom; Zoltán Ésik (IFIP TCS, 2006)

Preface. - Alberto Bertoni; Zoltán Ésik; Juhani Karhumäki (Theor. Comput. Sci., 2006)

Preface. - Zoltán Ésik (Theor. Comput. Sci., 2006)

Characterizing CTL-like logics on finite trees. - Zoltán Ésik (Theor. Comput. Sci., 2006)

Aperiodicity in Tree Automata. - Zoltán Ésik; Szabolcs Iván (CAI, 2007)

Regular and Algebraic Words and Ordinals. - Stephen L. Bloom; Zoltán Ésik (CALCO, 2007)

An Algebraic Characterization of Wolper's Logic. - Zoltán Ésik; Gabriela Martín (FCS, 2007)

Axiomatizing rational power series - Stephen L. Bloom; Zoltán Ésik (CoRR, 2007)

Fuzzy tree automata. - Zoltán Ésik; Guangwu Liu (Fuzzy Sets Syst., 2007)

Boolean Fuzzy Sets. - Zoltán Ésik; Werner Kuich (Int. J. Found. Comput. Sci., 2007)

A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. - Zoltán Ésik; Werner Kuich (J. Autom. Lang. Comb., 2007)

Iteration Semirings. - Zoltán Ésik (Developments in Language Theory, 2008)

Games for Temporal Logics on Trees. - Zoltán Ésik; Szabolcs Iván (CIAA, 2008)

Partial Conway and Iteration Semirings. - Stephen L. Bloom; Zoltán Ésik; Werner Kuich (Fundam. Informaticae, 2008)

Products of Tree Automata with an Application to Temporal Logic. - Zoltán Ésik; Szabolcs Iván (Fundam. Informaticae, 2008)

Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. - Zoltán Ésik; Szabolcs Iván (Fundam. Informaticae, 2008)

Cycle-Free Finite Automata in Partial Iterative Semirings. - Stephen L. Bloom; Zoltán Ésik; Werner Kuich (CAI, 2009)

Iteration Grove Theories with Applications. - Zoltán Ésik; Tamás Hajgató (CAI, 2009)

Scattered Algebraic Linear Orderings. - Stephen L. Bloom; Zoltán Ésik (FICS, 2009)

Context-Free Languages of Countable Words. - Zoltán Ésik; Szabolcs Iván (ICTAC, 2009)

Axiomatizing rational power series over natural numbers. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 2009)

Estimation of state complexity of combined operations. - Zoltán Ésik; Yuan Gao 001; Guangwu Liu; Sheng Yu 001 (Theor. Comput. Sci., 2009)

Simulation vs. Equivalence. - Zoltán Ésik; Andreas Maletti (FCS, 2010)

Simulations of Weighted Tree Automata. - Zoltán Ésik; Andreas Maletti (CIAA, 2010)

An undecidable property of context-free languages - Zoltán Ésik (CoRR, 2010)

Free iterative and iteration K-semialgebras - Zoltán Ésik; Werner Kuich (CoRR, 2010)

Representing Small Ordinals by Finite Automata - Zoltán Ésik (DCFS, 2010)

Algebraic Ordinals. - Stephen L. Bloom; Zoltán Ésik (Fundam. Informaticae, 2010)

Algebraic Characterization of Logically Defined Tree Languages. - Zoltán Ésik; Pascal Weil (Int. J. Algebra Comput., 2010)

Axiomatizing the equational theory of regular tree languages. - Zoltán Ésik (J. Log. Algebraic Methods Program., 2010)

A Mezei-Wright theorem for categorical algebras. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 2010)

Preface. - Erzsébet Csuhaj-Varjú; Zoltán Ésik (Theor. Comput. Sci., 2010)

Partial Conway and Iteration Semiring-Semimodule Pairs. - Zoltán Ésik (Algebraic Foundations in Computer Science, 2011)

Kleene Theorem in Partial Conway Theories with Applications. - Zoltán Ésik; Tamás Hajgató (Algebraic Foundations in Computer Science, 2011)

A Unifying Kleene Theorem for Weighted Finite Automata. - Zoltán Ésik; Werner Kuich (Rainbow of Computer Science, 2011)

Scattered Context-Free Linear Orderings. - Zoltán Ésik (Developments in Language Theory, 2011)

Multi-linear iterative K-Sigma-semialgebras - Zoltán Ésik (CoRR, 2011)

Context-free ordinals - Zoltán Ésik; Szabolcs Iván (CoRR, 2011)

Multi-Linear Iterative K-Σ-Semialgebras. - Zoltán Ésik (MFPS, 2011)

Stephen L. Bloom 1940-2010. - Zoltán Ésik; Klaus Sutner (Fundam. Informaticae, 2011)

Algebraic Linear Orderings. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 2011)

The Category of Simulations for Weighted Tree Automata. - Zoltán Ésik; Andreas Maletti (Int. J. Found. Comput. Sci., 2011)

An undecidable property of context-free linear orders. - Zoltán Ésik (Inf. Process. Lett., 2011)

Dagger extension theorem. - Zoltán Ésik; Tamás Hajgató (Math. Struct. Comput. Sci., 2011)

Büchi context-free languages. - Zoltán Ésik; Szabolcs Iván (Theor. Comput. Sci., 2011)

Algebraic Synchronization Trees and Processes. - Luca Aceto; Arnaud Carayol; Zoltán Ésik; Anna Ingólfsdóttir (ICALP (2), 2012)

A Context-Free Linear Ordering with an Undecidable First-Order Theory. - Arnaud Carayol; Zoltán Ésik (IFIP TCS, 2012)

Hausdorff Rank of Scattered Context-Free Linear Orders. - Zoltán Ésik; Szabolcs Iván (LATIN, 2012)

Preface. - Pál Dömösi; Zoltán Ésik (Int. J. Found. Comput. Sci., 2012)

Ordinal Automata and Cantor Normal Form. - Zoltán Ésik (Int. J. Found. Comput. Sci., 2012)

On Müller context-free grammars. - Zoltán Ésik; Szabolcs Iván (Theor. Comput. Sci., 2012)

Kleene Algebras and Semimodules for Energy Problems. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (ATVA, 2013)

Conway and iteration hemirings. - Manfred Droste; Zoltán Ésik; Werner Kuich (CoRR, 2013)

Operational characterization of scattered MCFLs – Technical Report - Zoltán Ésik; Szabolcs Iván (CoRR, 2013)

A Connection Between Concurrency and Language Theory. - Zoltán Ésik (MFPS, 2013)

On Context-Free Languages of Scattered Words. - Zoltán Ésik; Satoshi Okawa (Int. J. Found. Comput. Sci., 2013)

The FC-rank of a context-free language. - Arnaud Carayol; Zoltán Ésik (Inf. Process. Lett., 2013)

Free inductive K-semialgebras. - Zoltán Ésik; Werner Kuich (J. Log. Algebraic Methods Program., 2013)

On Power Series over a Graded Monoid. - Zoltán Ésik; Werner Kuich (Computing with New Resources, 2014)

Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars. - Zoltán Ésik; Panos Rondogiannis (WoLLIC, 2014)

Equational properties of saturated least fixed points. - Zoltán Ésik (CoRR, 2014)

Conway and iteration hemirings Part 1. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Algebra Comput., 2014)

Conway and iteration hemirings Part 2. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Algebra Comput., 2014)

Operational Characterization of Scattered MCFLs. - Zoltán Ésik; Szabolcs Iván (Int. J. Found. Comput. Sci., 2014)

On the Structure of Free Iteration Semirings. - Zoltán Ésik; Tamás Hajgató (J. Autom. Lang. Comb., 2014)

Axiomatizing weighted synchronization trees and weighted bisimilarity. - Zoltán Ésik (Theor. Comput. Sci., 2014)

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. - Angelos Charalambidis; Zoltán Ésik; Panos Rondogiannis (Theory Pract. Log. Program., 2014)

*-Continuous Kleene ω-Algebras. - Zoltán Ésik; Uli Fahrenberg; Axel Legay (DLT, 2015)

A Representation Theorem for Stratified Complete Lattices. - Zoltán Ésik (TbiLLC, 2015)

Equational Properties of Stratified Least Fixed Points (Extended Abstract). - Zoltán Ésik (WoLLIC, 2015)

In Memory of Professor Ferenc Gécseg. - Zoltán Ésik; Zoltán Fülöp 001 (Acta Cybern., 2015)

Equational Axioms for Fixed Point Operations. - Zoltán Ésik (CoRR, 2015)

*-Continuous Kleene ω-Algebras for Energy Problems. - Zoltán Ésik; Uli Fahrenberg; Axel Legay (FICS, 2015)

Residuated Park theories. - Zoltán Ésik (J. Log. Comput., 2015)

A fixed point theorem for non-monotonic functions. - Zoltán Ésik; Panos Rondogiannis (Theor. Comput. Sci., 2015)

MSO-definable Properties of Muller Context-Free Languages Are Decidable. - Zoltán Ésik; Szabolcs Iván (DCFS, 2016)

Ternary Equational Languages. - Zoltán Ésik (CIAA, 2016)

Some Remarks on Conway and Iteration Theories. - Zoltán Ésik; Sergey Goncharov 001 (CoRR, 2016)

Solving Fixed Point Equations over Complete Semirings. - Zoltán Ésik; Werner Kuich (The Role of Theory in Computer Science, 2017)

Commutative Positive Varieties of Languages. - Jorge Almeida 001; Zoltán Ésik; Jean-Éric Pin (Acta Cybern., 2017)

An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (Acta Cybern., 2017)

An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (Acta Cybern., 2017)

Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems. - Zoltán Ésik; Werner Kuich (Acta Cybern., 2017)

An analysis of the equational properties of the well-founded fixed point. - Arnaud Carayol; Zoltán Ésik (J. Log. Algebraic Methods Program., 2017)

Equational axioms associated with finite automata for fixed point operations in cartesian categories. - Zoltán Ésik (Math. Struct. Comput. Sci., 2017)

Two equational theories of partial words. - Christian Choffrut; Zoltán Ésik (Theor. Comput. Sci., 2018)

On Free ω-Continuous and Regular Ordered Algebras. - Zoltán Ésik; Dexter Kozen (Log. Methods Comput. Sci., 2019)

Equational properties of fixed-point operations in cartesian categories: An overview. - Zoltán Ésik (Math. Struct. Comput. Sci., 2019)

Equational theories for automata. - Zoltán Ésik (Handbook of Automata Theory (I.), 2021)

The Triple-Pair Construction for Weighted ω-Pushdown Automata. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Found. Comput. Sci., 2022)