Zoltán Ésik - RankMe

258 papers A* 2A 2B 24C 16Journal 168Unranked 34

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	The Triple-Pair Construction for Weighted ω-Pushdown Automata. Int. J. Found. Comput. Sci. Manfred Droste, Zoltán Ésik, Werner Kuich
2021	—	`ch.`	Equational theories for automata. Handbook of Automata Theory (I.) Zoltán Ésik
2019	J	`jnl`	Equational properties of fixed-point operations in cartesian categories: An overview. Math. Struct. Comput. Sci. Zoltán Ésik
2019	J	`jnl`	On Free ω-Continuous and Regular Ordered Algebras. Log. Methods Comput. Sci. Zoltán Ésik, Dexter Kozen
2018	J	`jnl`	Two equational theories of partial words. Theor. Comput. Sci. Christian Choffrut, Zoltán Ésik
2017	J	`jnl`	An Algebraic Approach to Energy Problems I - Acta Cybern. Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2017	J	`jnl`	An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions. Acta Cybern. Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2017	J	`jnl`	An analysis of the equational properties of the well-founded fixed point. J. Log. Algebraic Methods Program. Arnaud Carayol, Zoltán Ésik
2017	J	`jnl`	Commutative Positive Varieties of Languages. Acta Cybern. Jorge Almeida, Zoltán Ésik, Jean-Éric Pin
2017	J	`jnl`	Commutative positive varieties of languages. CoRR Jorge Almeida, Zoltán Ésik, Jean-Éric Pin
2017	J	`jnl`	Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems. Acta Cybern. Zoltán Ésik, Werner Kuich
2017	J	`jnl`	Equational axioms associated with finite automata for fixed point operations in cartesian categories. Math. Struct. Comput. Sci. Zoltán Ésik
2017	—	`conf`	Solving Fixed Point Equations over Complete Semirings. The Role of Theory in Computer Science Zoltán Ésik, Werner Kuich
2017	—	`conf`	The Triple-Pair Construction for Weighted ω-Pushdown Automata. AFL Manfred Droste, Zoltán Ésik, Werner Kuich
2016	J	`jnl`	Algebraic Synchronization Trees and Processes. CoRR Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
2016	A*	`conf`	An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR Arnaud Carayol, Zoltán Ésik
2016	—	`conf`	MSO-definable Properties of Muller Context-Free Languages Are Decidable. DCFS Zoltán Ésik, Szabolcs Iván
2016	J	`jnl`	On Free ω-Continuous and Regular Ordered Algebras. CoRR Zoltán Ésik, Dexter Kozen
2016	J	`jnl`	Some Remarks on Conway and Iteration Theories. CoRR Zoltán Ésik, Sergey Goncharov
2016	C	`conf`	Ternary Equational Languages. CIAA Zoltán Ésik
2015	—	`conf`	*-Continuous Kleene ω-Algebras for Energy Problems. FICS Zoltán Ésik, Uli Fahrenberg, Axel Legay
2015	C	`conf`	*-Continuous Kleene ω-Algebras. DLT Zoltán Ésik, Uli Fahrenberg, Axel Legay
2015	J	`jnl`	*-Continuous Kleene ω-Algebras. CoRR Zoltán Ésik, Uli Fahrenberg, Axel Legay
2015	—	`conf`	A Representation Theorem for Stratified Complete Lattices. TbiLLC Zoltán Ésik
2015	J	`jnl`	A fixed point theorem for non-monotonic functions. Theor. Comput. Sci. Zoltán Ésik, Panos Rondogiannis
2015	J	`jnl`	A representation theorem for stratified complete lattices. CoRR Zoltán Ésik
2015	J	`jnl`	An analysis of the equational properties of the well-founded fixed point. CoRR Arnaud Carayol, Zoltán Ésik
2015	J	`jnl`	Equational Axioms for Fixed Point Operations. CoRR Zoltán Ésik
2015	—	`conf`	Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview. MFCS (1) Zoltán Ésik
2015	C	`conf`	Equational Properties of Stratified Least Fixed Points (Extended Abstract). WoLLIC Zoltán Ésik
2015	J	`jnl`	In Memory of Professor Ferenc Gécseg. Acta Cybern. Zoltán Ésik, Zoltán Fülöp
2015	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Zoltán Ésik
2015	J	`jnl`	Residuated Park theories. J. Log. Comput. Zoltán Ésik
2014	J	`jnl`	A Fixed Point Theorem for Non-Monotonic Functions. CoRR Zoltán Ésik, Panos Rondogiannis
2014	J	`jnl`	Axiomatizing weighted synchronization trees and weighted bisimilarity. Theor. Comput. Sci. Zoltán Ésik
2014	J	`jnl`	Conway and iteration hemirings Part 1. Int. J. Algebra Comput. Manfred Droste, Zoltán Ésik, Werner Kuich
2014	J	`jnl`	Conway and iteration hemirings Part 2. Int. J. Algebra Comput. Manfred Droste, Zoltán Ésik, Werner Kuich
2014	J	`jnl`	Equational properties of saturated least fixed points. CoRR Zoltán Ésik
2014	—	`ed.`	Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I MFCS (1) Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
2014	—	`ed.`	Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II MFCS (2) Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
2014	J	`jnl`	Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. CoRR Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis
2014	J	`jnl`	Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. Theory Pract. Log. Program. Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis
2014	—	`conf`	On Power Series over a Graded Monoid. Computing with New Resources Zoltán Ésik, Werner Kuich
2014	J	`jnl`	On the Structure of Free Iteration Semirings. J. Autom. Lang. Comb. Zoltán Ésik, Tamás Hajgató
2014	J	`jnl`	Operational Characterization of Scattered MCFLs. Int. J. Found. Comput. Sci. Zoltán Ésik, Szabolcs Iván
2014	—	`ed.`	Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. AFL Zoltán Ésik, Zoltán Fülöp
2014	C	`conf`	Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars. WoLLIC Zoltán Ésik, Panos Rondogiannis
2013	B	`conf`	A Connection Between Concurrency and Language Theory. MFPS Zoltán Ésik
2013	J	`jnl`	A connection between concurrency and language theory CoRR Zoltán Ésik
2013	J	`jnl`	Conway and iteration hemirings. CoRR Manfred Droste, Zoltán Ésik, Werner Kuich
2013	J	`jnl`	Free inductive K-semialgebras. J. Log. Algebraic Methods Program. Zoltán Ésik, Werner Kuich
2013	B	`conf`	Kleene Algebras and Semimodules for Energy Problems. ATVA Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2013	J	`jnl`	Kleene Algebras and Semimodules for Energy Problems. CoRR Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2013	J	`jnl`	On Context-Free Languages of Scattered Words. Int. J. Found. Comput. Sci. Zoltán Ésik, Satoshi Okawa
2013	C	`conf`	Operational Characterization of Scattered MCFLs. Developments in Language Theory Zoltán Ésik, Szabolcs Iván
2013	J	`jnl`	Operational characterization of scattered MCFLs -- Technical Report CoRR Zoltán Ésik, Szabolcs Iván
2013	J	`jnl`	The FC-rank of a context-free language. Inf. Process. Lett. Arnaud Carayol, Zoltán Ésik
2012	—	`conf`	A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS Arnaud Carayol, Zoltán Ésik
2012	—	`conf`	Algebraic Synchronization Trees and Processes. ICALP (2) Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
2012	B	`conf`	Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN Zoltán Ésik, Szabolcs Iván
2012	C	`conf`	On Context-Free Languages of Scattered Words. Developments in Language Theory Zoltán Ésik, Satoshi Okawa
2012	J	`jnl`	On Müller context-free grammars. Theor. Comput. Sci. Zoltán Ésik, Szabolcs Iván
2012	J	`jnl`	Ordinal Automata and Cantor Normal Form. Int. J. Found. Comput. Sci. Zoltán Ésik
2012	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Pál Dömösi, Zoltán Ésik
2012	—	`ed.`	Proceedings 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia, 24th March 2012. FICS Dale Miller, Zoltán Ésik
2012	J	`jnl`	The FC-rank of a context-free language CoRR Arnaud Carayol, Zoltán Ésik
2011	—	`conf`	A Unifying Kleene Theorem for Weighted Finite Automata. Rainbow of Computer Science Zoltán Ésik, Werner Kuich
2011	J	`jnl`	Algebraic Linear Orderings. Int. J. Found. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
2011	J	`jnl`	An undecidable property of context-free linear orders. Inf. Process. Lett. Zoltán Ésik
2011	J	`jnl`	Büchi context-free languages. Theor. Comput. Sci. Zoltán Ésik, Szabolcs Iván
2011	J	`jnl`	Context-free ordinals CoRR Zoltán Ésik, Szabolcs Iván
2011	J	`jnl`	Dagger extension theorem. Math. Struct. Comput. Sci. Zoltán Ésik, Tamás Hajgató
2011	—	`conf`	Kleene Theorem in Partial Conway Theories with Applications. Algebraic Foundations in Computer Science Zoltán Ésik, Tamás Hajgató
2011	B	`conf`	Multi-Linear Iterative K-Σ-Semialgebras. MFPS Zoltán Ésik
2011	J	`jnl`	Multi-linear iterative K-Sigma-semialgebras CoRR Zoltán Ésik
2011	J	`jnl`	On context-free languages of scattered words CoRR Zoltán Ésik, Satoshi Okawa
2011	—	`conf`	Partial Conway and Iteration Semiring-Semimodule Pairs. Algebraic Foundations in Computer Science Zoltán Ésik
2011	J	`jnl`	Residuated Park Theories CoRR Zoltán Ésik
2011	C	`conf`	Scattered Context-Free Linear Orderings. Developments in Language Theory Zoltán Ésik
2011	J	`jnl`	Scattered context-free linear orderings CoRR Zoltán Ésik
2011	J	`jnl`	Stephen L. Bloom 1940-2010. Fundam. Informaticae Zoltán Ésik, Klaus Sutner
2011	J	`jnl`	The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. Zoltán Ésik, Andreas Maletti
2010	J	`jnl`	A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
2010	J	`jnl`	Algebraic Characterization of Logically Defined Tree Languages. Int. J. Algebra Comput. Zoltán Ésik, Pascal Weil
2010	J	`jnl`	Algebraic Linear Orderings CoRR Stephen L. Bloom, Zoltán Ésik
2010	J	`jnl`	Algebraic Ordinals. Fundam. Informaticae Stephen L. Bloom, Zoltán Ésik
2010	J	`jnl`	An undecidable property of context-free languages CoRR Zoltán Ésik
2010	J	`jnl`	Axiomatizing the equational theory of regular tree languages. J. Log. Algebraic Methods Program. Zoltán Ésik
2010	J	`jnl`	Free inductive K-semialgebras CoRR Zoltán Ésik, Werner Kuich
2010	J	`jnl`	Free iterative and iteration K-semialgebras CoRR Zoltán Ésik, Werner Kuich
2010	C	`conf`	On Müller Context-Free Grammars. Developments in Language Theory Zoltán Ésik, Szabolcs Iván
2010	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Erzsébet Csuhaj-Varjú, Zoltán Ésik
2010	J	`jnl`	Preface. Theor. Comput. Sci. Erzsébet Csuhaj-Varjú, Zoltán Ésik
2010	—	`conf`	Representing Small Ordinals by Finite Automata DCFS Zoltán Ésik
2010	J	`jnl`	Simulation vs. Equivalence CoRR Zoltán Ésik, Andreas Maletti
2010	—	`conf`	Simulation vs. Equivalence. FCS Zoltán Ésik, Andreas Maletti
2010	J	`jnl`	Simulations of Weighted Tree Automata CoRR Zoltán Ésik, Andreas Maletti
2010	C	`conf`	Simulations of Weighted Tree Automata. CIAA Zoltán Ésik, Andreas Maletti
2009	J	`jnl`	Algebraic Ordinals CoRR Stephen L. Bloom, Zoltán Ésik
2009	—	`ed.`	Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday Automata, Formal Languages, and Related Topics Zoltán Ésik, Zoltán Fülöp
2009	J	`jnl`	Axiomatizing rational power series over natural numbers. Inf. Comput. Stephen L. Bloom, Zoltán Ésik
2009	C	`conf`	Context-Free Languages of Countable Words. ICTAC Zoltán Ésik, Szabolcs Iván
2009	—	`conf`	Cycle-Free Finite Automata in Partial Iterative Semirings. CAI Stephen L. Bloom, Zoltán Ésik, Werner Kuich
2009	J	`jnl`	Estimation of state complexity of combined operations. Theor. Comput. Sci. Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
2009	—	`conf`	Iteration Grove Theories with Applications. CAI Zoltán Ésik, Tamás Hajgató
2009	—	`conf`	Scattered Algebraic Linear Orderings. FICS Stephen L. Bloom, Zoltán Ésik
2008	—	`ed.`	Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings. AFL Erzsébet Csuhaj-Varjú, Zoltán Ésik
2008	—	`conf`	Estimation of State Complexity of Combined Operations. DCFS Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
2008	C	`conf`	Games for Temporal Logics on Trees. CIAA Zoltán Ésik, Szabolcs Iván
2008	C	`conf`	Iteration Semirings. Developments in Language Theory Zoltán Ésik
2008	J	`jnl`	Partial Conway and Iteration Semirings. Fundam. Informaticae Stephen L. Bloom, Zoltán Ésik, Werner Kuich
2008	J	`jnl`	Products of Tree Automata with an Application to Temporal Logic. Fundam. Informaticae Zoltán Ésik, Szabolcs Iván
2008	J	`jnl`	Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Informaticae Zoltán Ésik, Szabolcs Iván
2007	J	`jnl`	A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. J. Autom. Lang. Comb. Zoltán Ésik, Werner Kuich
2007	J	`jnl`	Algebraic characterization of logically defined tree languages CoRR Zoltán Ésik, Pascal Weil
2007	—	`conf`	An Algebraic Characterization of Wolper's Logic. FCS Zoltán Ésik, Gabriela Martín
2007	—	`conf`	Aperiodicity in Tree Automata. CAI Zoltán Ésik, Szabolcs Iván
2007	J	`jnl`	Axiomatizing rational power series CoRR Stephen L. Bloom, Zoltán Ésik
2007	J	`jnl`	Boolean Fuzzy Sets. Int. J. Found. Comput. Sci. Zoltán Ésik, Werner Kuich
2007	B	`ed.`	Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings FCT Erzsébet Csuhaj-Varjú, Zoltán Ésik
2007	J	`jnl`	Fuzzy tree automata. Fuzzy Sets Syst. Zoltán Ésik, Guangwu Liu
2007	J	`jnl`	Partial Conway and iteration semirings CoRR Stephen L. Bloom, Zoltán Ésik, Werner Kuich
2007	B	`conf`	Regular and Algebraic Words and Ordinals. CALCO Stephen L. Bloom, Zoltán Ésik
2006	J	`jnl`	Algebraic recognizability of regular tree languages CoRR Zoltán Ésik, Pascal Weil
2006	J	`jnl`	Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. Zoltán Ésik
2006	—	`conf`	Completing Categorical Algebras. IFIP TCS Stephen L. Bloom, Zoltán Ésik
2006	B	`ed.`	Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings CSL Zoltán Ésik
2006	J	`jnl`	Preface. Acta Cybern. Zoltán Ésik
2006	J	`jnl`	Preface. Theor. Comput. Sci. Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki
2006	J	`jnl`	Preface. Theor. Comput. Sci. Zoltán Ésik
2006	—	`book`	Recent Advances in Formal Languages and Applications Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana
2005	J	`jnl`	A Semiring-Semimodule Generalization of ω-Regular Languages I. J. Autom. Lang. Comb. Zoltán Ésik, Werner Kuich
2005	J	`jnl`	A Semiring-Semimodule Generalization of ω-Regular Languages II. J. Autom. Lang. Comb. Zoltán Ésik, Werner Kuich
2005	J	`jnl`	Algebraic and graph-theoretic properties of infinite n-posets. RAIRO Theor. Informatics Appl. Zoltán Ésik, Zoltán L. Németh
2005	J	`jnl`	Algebraic recognizability of regular tree languages. Theor. Comput. Sci. Zoltán Ésik, Pascal Weil
2005	J	`jnl`	Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. Zoltán Ésik, Hans Leiß
2005	—	`conf`	Cascade Products and Temporal Logics on Finite Trees. APC 25 Zoltán Ésik
2005	J	`jnl`	Guest editors' foreword: Process Algebra. Theor. Comput. Sci. Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Zoltán Ésik
2005	J	`jnl`	The equational theory of regular words. Inf. Comput. Stephen L. Bloom, Zoltán Ésik
2004	—	`conf`	A Semiring-Semimodule Generalization of omega-Context-Free Languages. Theory Is Forever Zoltán Ésik, Werner Kuich
2004	B	`conf`	An Algebraic Generalization of omega-Regular Languages. MFCS Zoltán Ésik, Werner Kuich
2004	J	`jnl`	Axiomatizing omega and omega-op powers of words. RAIRO Theor. Informatics Appl. Stephen L. Bloom, Zoltán Ésik
2004	J	`jnl`	Foreword. RAIRO Theor. Informatics Appl. Zoltán Ésik, Igor Walukiewicz
2004	J	`jnl`	Foreword. Theor. Comput. Sci. Zoltán Ésik, Zoltán Fülöp
2004	J	`jnl`	Higher Dimensional Automata. J. Autom. Lang. Comb. Zoltán Ésik, Zoltán L. Németh
2004	J	`jnl`	Inductive star-semirings. Theor. Comput. Sci. Zoltán Ésik, Werner Kuich
2003	J	`jnl`	An Extension Theorem with an Application to Formal Tree Series. J. Autom. Lang. Comb. Stephen L. Bloom, Zoltán Ésik
2003	—	`conf`	Axioms for Regular Words: Extended Abstract. FSTTCS Stephen L. Bloom, Zoltán Ésik
2003	J	`jnl`	Deciding whether the frontier of a regular tree is scattered. Fundam. Informaticae Stephen L. Bloom, Zoltán Ésik
2003	C	`ed.`	Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings Developments in Language Theory Zoltán Ésik, Zoltán Fülöp
2003	J	`jnl`	Equational theories of tropical semirings. Theor. Comput. Sci. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2003	—	`ed.`	FICS '03 - Fixed Points in Computer Science, Proceedings of an International Workshop, Warsaw, Poland, April 12-13, 2003. FICS Zoltán Ésik, Igor Walukiewicz
2003	J	`jnl`	Foreword. RAIRO Theor. Informatics Appl. Zoltán Ésik, Anna Ingólfsdóttir
2003	J	`jnl`	Formal Tree Series. J. Autom. Lang. Comb. Zoltán Ésik, Werner Kuich
2003	J	`jnl`	Hazard Algebras. Formal Methods Syst. Des. Janusz A. Brzozowski, Zoltán Ésik
2003	—	`conf`	On Logically Defined Recognizable Tree Languages. FSTTCS Zoltán Ésik, Pascal Weil
2003	J	`jnl`	Regular languages definable by Lindström quantifiers. RAIRO Theor. Informatics Appl. Zoltán Ésik, Kim Guldstrand Larsen
2003	J	`jnl`	Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata. Acta Cybern. Zoltán Ésik, Masami Ito
2003	J	`jnl`	The max-plus algebra of the natural numbers has no finite equational basis. Theor. Comput. Sci. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2002	J	`jnl`	A Fully Equational Proof of Parikh's Theorem. RAIRO Theor. Informatics Appl. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2002	J	`jnl`	Axiomatizing the subsumption and subword preorders on finite and infinite partial words. Theor. Comput. Sci. Zoltán Ésik
2002	J	`jnl`	Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. Zoltán Ésik
2002	—	`conf`	Equational Axioms for Probabilistic Bisimilarity. AMAST Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2002	C	`conf`	Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. Developments in Language Theory Zoltán Ésik
2002	—	`ed.`	Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings FICS Zoltán Ésik, Anna Ingólfsdóttir
2002	B	`conf`	Greibach Normal Form in Algebraically Complete Semirings. CSL Zoltán Ésik, Hans Leiß
2002	J	`jnl`	Rationally Additive Semirings. J. Univers. Comput. Sci. Zoltán Ésik, Werner Kuich
2002	—	`conf`	Unique, guarded fixed points in an additive setting: Extended Abstract. CTCS Stephen L. Bloom, Zoltán Ésik
2001	—	`conf`	A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets. Words, Semigroups, and Transductions Zoltán Ésik, Werner Kuich
2001	—	`conf`	Algebras for Hazard Detection. ISMVL Janusz A. Brzozowski, Zoltán Ésik, Y. Iland
2001	C	`conf`	Automata on Series-Parallel Biposets. Developments in Language Theory Zoltán Ésik, Zoltán L. Németh
2001	B	`conf`	Axiomatizing Tropical Semirings. FoSSaCS Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2001	J	`jnl`	Homomorphic Simulation and Letichevsky's Criterion. J. Autom. Lang. Comb. Pál Dömösi, Zoltán Ésik
2001	J	`jnl`	Iteration 2-theories. Appl. Categorical Struct. Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes
2001	J	`jnl`	On Equations for Union-Free Regular Languages. Inf. Comput. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
2001	C	`conf`	The Equational Theory of Fixed Points with Applications to Generalized Language Theory. Developments in Language Theory Zoltán Ésik
2000	J	`jnl`	A Kleene Theorem for Lindenmayerian Algebraic Power Series. J. Autom. Lang. Comb. Zoltán Ésik, Werner Kuich
2000	J	`jnl`	A proof of the Krohn-Rhodes Decomposition Theorem. Theor. Comput. Sci. Zoltán Ésik
2000	B	`conf`	Axiomatizing the Least Fixed Point Operation and Binary Supremum. CSL Zoltán Ésik
2000	—	`ch.`	Hazard Algebras (Extended Abstract). A Half-Century of Automata Theory Janusz A. Brzozowski, Zoltán Ésik
2000	B	`conf`	Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN Stephen L. Bloom, Zoltán Ésik
2000	B	`conf`	Iteration Theories of Boolean Functions. MFCS Zoltán Ésik
2000	A	`conf`	On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. STACS Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2000	J	`jnl`	The Power of the Group-Identities for Iteration. Int. J. Algebra Comput. Zoltán Ésik
2000	J	`jnl`	The Variety of Kleene Algebras with Conversion is not Finitely Based. Theor. Comput. Sci. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
1999	J	`jnl`	A Note on Equations for Commutative Regular Languages. Inf. Process. Lett. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
1999	J	`jnl`	Axiomatizing Iteration Categories. Acta Cybern. Zoltán Ésik
1999	J	`jnl`	Group Axioms for Iteration. Inf. Comput. Zoltán Ésik
1999	—	`conf`	Series and Parallel Operations on Pomsets. FSTTCS Zoltán Ésik, Satoshi Okawa
1998	J	`jnl`	A Cayley Theorem for Ternary Algebras. Int. J. Algebra Comput. Zoltán Ésik
1998	A	`conf`	Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). STACS Zoltán Ésik
1998	J	`jnl`	Equational Properties of Iteration in Algebraically Complete Categories. Theor. Comput. Sci. Zoltán Ésik, Anna Labella
1998	J	`jnl`	Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Informatica Zoltán Ésik, Michael Bertol
1998	J	`jnl`	Semantics on Flowchart Programs and the Free Conway Theories. RAIRO Theor. Informatics Appl. L. Bernátsky, Zoltán Ésik
1998	J	`jnl`	Shuffle binoids. RAIRO Theor. Informatics Appl. Stephen L. Bloom, Zoltán Ésik
1997	J	`jnl`	Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. Stephen L. Bloom, Zoltán Ésik
1997	J	`jnl`	Completeness of Park Induction. Theor. Comput. Sci. Zoltán Ésik
1997	—	`conf`	Iteration 2-Theories: Extended Abstract. AMAST Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes
1997	J	`jnl`	The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1997	J	`jnl`	Varieties Generated by Languages with Poset Operations. Math. Struct. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1996	B	`conf`	Equational Properties of Iteration in Algebraically Complete Categories. MFCS Zoltán Ésik, Anna Labella
1996	J	`jnl`	Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1996	J	`jnl`	Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1996	J	`jnl`	Two Axiomatizations of a Star Semiring Quasi-Variety. Bull. EATCS Stephen L. Bloom, Zoltán Ésik
1995	J	`jnl`	Equational Properties of Kleene Algebras of Relations with Conversion. Theor. Comput. Sci. Zoltán Ésik, L. Bernátsky
1995	B	`conf`	Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN Stephen L. Bloom, Zoltán Ésik
1995	—	`conf`	Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT Stephen L. Bloom, Zoltán Ésik
1995	A*	`conf`	Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP Zoltán Ésik, Michael Bertol
1995	B	`conf`	Scott induction and equational proofs. MFPS Zoltán Ésik, L. Bernátsky
1995	J	`jnl`	Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1994	B	`conf`	Solving Polynomial Fixed Point Equations. MFCS Stephen L. Bloom, Zoltán Ésik
1993	J	`jnl`	Equational Axioms for Regular Sets. Math. Struct. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1993	J	`jnl`	Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1993	B	`ed.`	Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings FCT Zoltán Ésik
1993	—	`book`	Iteration Theories - The Equational Logic of Iterative Processes Stephen L. Bloom, Zoltán Ésik
1993	J	`jnl`	Iteration Theories of Synchronization Trees Inf. Comput. Stephen L. Bloom, Zoltán Ésik, Dirk Taubner
1993	J	`jnl`	Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. Stephen L. Bloom, Zoltán Ésik
1993	J	`jnl`	Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. Stephen L. Bloom, Zoltán Ésik
1993	B	`conf`	Some Quasi-Varieties of Iteration Theories. MFPS Stephen L. Bloom, Zoltán Ésik
1992	J	`jnl`	Iteration Algebras. Int. J. Found. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1991	J	`jnl`	A note on isomorphic simulation of automata by networks of two-state automata. Discret. Appl. Math. Zoltán Ésik
1991	J	`jnl`	Cayley iff Stone. Bull. EATCS Stephen L. Bloom, Zoltán Ésik
1991	J	`jnl`	Floyd-Hoare Logic in Iteration Theories. J. ACM Stephen L. Bloom, Zoltán Ésik
1991	—	`conf`	Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 Stephen L. Bloom, Zoltán Ésik
1991	B	`conf`	Program Correctness and Matricial Iteration Theories. MFPS Stephen L. Bloom, Zoltán Ésik
1991	J	`jnl`	Results on Homomorphic Realization of Automata by alpha_0-Products. Theor. Comput. Sci. Zoltán Ésik
1990	J	`jnl`	A note on the axiomatization of iteration theories. Acta Cybern. Zoltán Ésik
1990	J	`jnl`	Iteration theories of synchronization trees Forschungsberichte, TU Munich Stephen L. Bloom, Zoltán Ésik, Dirk Taubner
1990	J	`jnl`	Product hierarchies of automata and homomorphic simulation. Acta Cybern. Pál Dömösi, Zoltán Ésik
1989	J	`jnl`	Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. Stephen L. Bloom, Zoltán Ésik
1989	B	`conf`	On Product Hierarchies of Automata. FCT Pál Dömösi, Zoltán Ésik, Balázs Imreh
1988	—	`conf`	An Extension of the Krohn-Rhodes Decomposition of Automata. IMYCS Zoltán Ésik
1988	J	`jnl`	Critical Classes for the alpha_0-Product. Theor. Comput. Sci. Pál Dömösi, Zoltán Ésik
1988	J	`jnl`	Independence of the Equational Axioms for Iteration Theories. J. Comput. Syst. Sci. Zoltán Ésik
1988	J	`jnl`	On homomorphic simulation of automata by α Acta Cybern. Pál Dömösi, Zoltán Ésik
1988	J	`jnl`	On the hierarchy of ν Acta Cybern. Pál Dömösi, Zoltán Ésik
1988	J	`jnl`	Varieties of Iteration Theories. SIAM J. Comput. Stephen L. Bloom, Zoltán Ésik
1987	J	`jnl`	A note on α Acta Cybern. Zoltán Ésik, J. Virágh
1987	J	`jnl`	Loop products and loop-free products. Acta Cybern. Zoltán Ésik
1987	J	`jnl`	On a Representation of Tree Automata. Theor. Comput. Sci. Zoltán Ésik, Ferenc Gécseg
1987	J	`jnl`	On isomorphic realization of automata with α Acta Cybern. Zoltán Ésik
1986	J	`jnl`	Complete Classes of Automata for the alpha-0-Product. Theor. Comput. Sci. Zoltán Ésik, Pál Dömösi
1986	B	`conf`	Homomorphic Realizations of Automata with Compositions. MFCS Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
1986	J	`jnl`	On alpha-0-Products and alpha-2-Products. Theor. Comput. Sci. Zoltán Ésik, Ferenc Gécseg
1986	J	`jnl`	On products of automata with identity. Acta Cybern. Zoltán Ésik, J. Virágh
1986	J	`jnl`	Varieties and general products of top-down algebras. Acta Cybern. Zoltán Ésik
1985	J	`jnl`	Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. Stephen L. Bloom, Zoltán Ésik
1985	J	`jnl`	On the weak equivalence of Elgot's flow-chart schemata. Acta Cybern. Zoltán Ésik
1984	J	`jnl`	Some varieties of iteration theories. Bull. EATCS Stephen L. Bloom, Zoltán Ésik
1983	J	`jnl`	Algebras of Iteration Theories. J. Comput. Syst. Sci. Zoltán Ésik
1983	J	`jnl`	Decidability results concerning tree transducers II. Acta Cybern. Zoltán Ésik
1983	J	`jnl`	General products and equational classes of automata. Acta Cybern. Zoltán Ésik, Ferenc Gécseg
1981	B	`conf`	An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. FCT Zoltán Ésik
1981	J	`jnl`	Remarks on finite commutative automata. Acta Cybern. Zoltán Ésik, Balázs Imreh
1981	J	`jnl`	Subdirectly irreducible commutative automata. Acta Cybern. Zoltán Ésik, Balázs Imreh
1980	J	`jnl`	Decidability results concerning tree transducers I. Acta Cybern. Zoltán Ésik
1979	B	`conf`	On functional tree transducers. FCT Zoltán Ésik
1976	J	`jnl`	On two problems of A. Salomaa. Acta Cybern. Zoltán Ésik