default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Ésik
Person information
- affiliation: University of Szeged, Hungary
- 1951 - 2016
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j135]Manfred Droste, Zoltán Ésik, Werner Kuich:
The Triple-Pair Construction for Weighted ω-Pushdown Automata. Int. J. Found. Comput. Sci. 33(3&4): 227-246 (2022)- 2021
- [p2]Zoltán Ésik:
Equational theories for automata. Handbook of Automata Theory (I.) 2021: 729-764
2010 – 2019
- 2019
- [j134]Zoltán Ésik, Dexter Kozen:
On Free ω-Continuous and Regular Ordered Algebras. Log. Methods Comput. Sci. 15(4) (2019) - [j133]Zoltán Ésik:
Equational properties of fixed-point operations in cartesian categories: An overview. Math. Struct. Comput. Sci. 29(6): 909-925 (2019) - 2018
- [j132]Christian Choffrut, Zoltán Ésik:
Two equational theories of partial words. Theor. Comput. Sci. 737: 19-39 (2018) - 2017
- [j131]Zoltán Ésik, Werner Kuich:
Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems. Acta Cybern. 23(1): 61-79 (2017) - [j130]Jorge Almeida, Zoltán Ésik, Jean-Éric Pin:
Commutative Positive Varieties of Languages. Acta Cybern. 23(1): 91-111 (2017) - [j129]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras. Acta Cybern. 23(1): 203-228 (2017) - [j128]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions. Acta Cybern. 23(1): 229-268 (2017) - [j127]Arnaud Carayol, Zoltán Ésik:
An analysis of the equational properties of the well-founded fixed point. J. Log. Algebraic Methods Program. 86(1): 308-318 (2017) - [j126]Zoltán Ésik:
Equational axioms associated with finite automata for fixed point operations in cartesian categories. Math. Struct. Comput. Sci. 27(1): 54-69 (2017) - [c74]Zoltán Ésik, Werner Kuich:
Solving Fixed Point Equations over Complete Semirings. The Role of Theory in Computer Science 2017: 33-58 - [c73]Manfred Droste, Zoltán Ésik, Werner Kuich:
The Triple-Pair Construction for Weighted ω-Pushdown Automata. AFL 2017: 101-113 - [i33]Jorge Almeida, Zoltán Ésik, Jean-Éric Pin:
Commutative positive varieties of languages. CoRR abs/1703.02154 (2017) - 2016
- [c72]Zoltán Ésik, Szabolcs Iván
:
MSO-definable Properties of Muller Context-Free Languages Are Decidable. DCFS 2016: 87-97 - [c71]Arnaud Carayol, Zoltán Ésik:
An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR 2016: 533-536 - [c70]Zoltán Ésik:
Ternary Equational Languages. CIAA 2016: 77-88 - [i32]Zoltán Ésik, Sergey Goncharov:
Some Remarks on Conway and Iteration Theories. CoRR abs/1603.00838 (2016) - [i31]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir:
Algebraic Synchronization Trees and Processes. CoRR abs/1610.00450 (2016) - [i30]Zoltán Ésik, Dexter Kozen:
On Free ω-Continuous and Regular Ordered Algebras. CoRR abs/1612.02106 (2016) - 2015
- [j125]Zoltán Ésik, Zoltán Fülöp:
In Memory of Professor Ferenc Gécseg. Acta Cybern. 22(2): 243-246 (2015) - [j124]Zoltán Ésik:
Preface. Int. J. Found. Comput. Sci. 26(8): 1007-1008 (2015) - [j123]Zoltán Ésik:
Residuated Park theories. J. Log. Comput. 25(2): 453-471 (2015) - [j122]Zoltán Ésik, Panos Rondogiannis:
A fixed point theorem for non-monotonic functions. Theor. Comput. Sci. 574: 18-38 (2015) - [c69]Zoltán Ésik, Uli Fahrenberg, Axel Legay:
*-Continuous Kleene ω-Algebras. DLT 2015: 240-251 - [c68]Zoltán Ésik:
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview. MFCS (1) 2015: 18-37 - [c67]Zoltán Ésik:
A Representation Theorem for Stratified Complete Lattices. TbiLLC 2015: 263-289 - [c66]Zoltán Ésik:
Equational Properties of Stratified Least Fixed Points (Extended Abstract). WoLLIC 2015: 174-188 - [c65]Zoltán Ésik, Uli Fahrenberg, Axel Legay:
*-Continuous Kleene ω-Algebras for Energy Problems. FICS 2015: 48-59 - [i29]Zoltán Ésik, Uli Fahrenberg, Axel Legay:
*-Continuous Kleene ω-Algebras. CoRR abs/1501.01118 (2015) - [i28]Zoltán Ésik:
Equational Axioms for Fixed Point Operations. CoRR abs/1501.02190 (2015) - [i27]Zoltán Ésik:
A representation theorem for stratified complete lattices. CoRR abs/1503.05124 (2015) - [i26]Arnaud Carayol, Zoltán Ésik:
An analysis of the equational properties of the well-founded fixed point. CoRR abs/1511.09423 (2015) - 2014
- [j121]Manfred Droste, Zoltán Ésik, Werner Kuich:
Conway and iteration hemirings Part 1. Int. J. Algebra Comput. 24(4): 461-482 (2014) - [j120]Manfred Droste, Zoltán Ésik, Werner Kuich:
Conway and iteration hemirings Part 2. Int. J. Algebra Comput. 24(4): 483-514 (2014) - [j119]Zoltán Ésik, Szabolcs Iván:
Operational Characterization of Scattered MCFLs. Int. J. Found. Comput. Sci. 25(8): 1001-1016 (2014) - [j118]Zoltán Ésik, Tamás Hajgató:
On the Structure of Free Iteration Semirings. J. Autom. Lang. Comb. 19(1-4): 57-66 (2014) - [j117]Zoltán Ésik:
Axiomatizing weighted synchronization trees and weighted bisimilarity. Theor. Comput. Sci. 534: 2-23 (2014) - [j116]Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis:
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. Theory Pract. Log. Program. 14(4-5): 725-737 (2014) - [c64]Zoltán Ésik, Werner Kuich:
On Power Series over a Graded Monoid. Computing with New Resources 2014: 49-55 - [c63]Zoltán Ésik, Panos Rondogiannis:
Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars. WoLLIC 2014: 166-180 - [e13]Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I. Lecture Notes in Computer Science 8634, Springer 2014, ISBN 978-3-662-44521-1 [contents] - [e12]Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Lecture Notes in Computer Science 8635, Springer 2014, ISBN 978-3-662-44464-1 [contents] - [e11]Zoltán Ésik, Zoltán Fülöp:
Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. EPTCS 151, 2014 [contents] - [i25]Zoltán Ésik, Panos Rondogiannis:
A Fixed Point Theorem for Non-Monotonic Functions. CoRR abs/1402.0299 (2014) - [i24]Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis:
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. CoRR abs/1405.3792 (2014) - [i23]Zoltán Ésik:
Equational properties of saturated least fixed points. CoRR abs/1410.8111 (2014) - 2013
- [j115]Zoltán Ésik, Satoshi Okawa:
On Context-Free Languages of Scattered Words. Int. J. Found. Comput. Sci. 24(7): 1029-1048 (2013) - [j114]Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. Inf. Process. Lett. 113(8): 285-287 (2013) - [j113]Zoltán Ésik, Werner Kuich:
Free inductive K-semialgebras. J. Log. Algebraic Methods Program. 82(3-4): 111-122 (2013) - [c62]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
Kleene Algebras and Semimodules for Energy Problems. ATVA 2013: 102-117 - [c61]Zoltán Ésik, Szabolcs Iván:
Operational Characterization of Scattered MCFLs. Developments in Language Theory 2013: 215-226 - [c60]Zoltán Ésik:
A Connection Between Concurrency and Language Theory. MFPS 2013: 143-164 - [i22]Zoltán Ésik:
A connection between concurrency and language theory. CoRR abs/1303.0044 (2013) - [i21]Zoltán Ésik, Szabolcs Iván:
Operational characterization of scattered MCFLs -- Technical Report. CoRR abs/1304.6388 (2013) - [i20]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
Kleene Algebras and Semimodules for Energy Problems. CoRR abs/1307.0635 (2013) - [i19]Manfred Droste, Zoltán Ésik, Werner Kuich:
Conway and iteration hemirings. CoRR abs/1307.0725 (2013) - 2012
- [j112]Zoltán Ésik:
Ordinal Automata and Cantor Normal Form. Int. J. Found. Comput. Sci. 23(1): 87-98 (2012) - [j111]Pál Dömösi, Zoltán Ésik:
Preface. Int. J. Found. Comput. Sci. 23(6): 1185-1188 (2012) - [j110]Zoltán Ésik, Szabolcs Iván:
On Müller context-free grammars. Theor. Comput. Sci. 416: 17-32 (2012) - [c59]Zoltán Ésik, Satoshi Okawa:
On Context-Free Languages of Scattered Words. Developments in Language Theory 2012: 142-153 - [c58]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir:
Algebraic Synchronization Trees and Processes. ICALP (2) 2012: 30-41 - [c57]Arnaud Carayol, Zoltán Ésik:
A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS 2012: 104-118 - [c56]Zoltán Ésik, Szabolcs Iván:
Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN 2012: 291-302 - [e10]Dale Miller, Zoltán Ésik:
Proceedings 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia, 24th March 2012. EPTCS 77, 2012 [contents] - [i18]Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. CoRR abs/1202.6275 (2012) - 2011
- [j109]Zoltán Ésik, Klaus Sutner:
Stephen L. Bloom 1940-2010. Fundam. Informaticae 109(4): 369-381 (2011) - [j108]Stephen L. Bloom, Zoltán Ésik:
Algebraic Linear Orderings. Int. J. Found. Comput. Sci. 22(2): 491-515 (2011) - [j107]Zoltán Ésik, Andreas Maletti:
The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. 22(8): 1845-1859 (2011) - [j106]Zoltán Ésik:
An undecidable property of context-free linear orders. Inf. Process. Lett. 111(3): 107-109 (2011) - [j105]Zoltán Ésik, Tamás Hajgató:
Dagger extension theorem. Math. Struct. Comput. Sci. 21(5): 1035-1066 (2011) - [j104]Zoltán Ésik, Szabolcs Iván:
Büchi context-free languages. Theor. Comput. Sci. 412(8-10): 805-821 (2011) - [c55]Zoltán Ésik:
Partial Conway and Iteration Semiring-Semimodule Pairs. Algebraic Foundations in Computer Science 2011: 56-71 - [c54]Zoltán Ésik, Tamás Hajgató:
Kleene Theorem in Partial Conway Theories with Applications. Algebraic Foundations in Computer Science 2011: 72-93 - [c53]Zoltán Ésik, Werner Kuich:
A Unifying Kleene Theorem for Weighted Finite Automata. Rainbow of Computer Science 2011: 76-89 - [c52]Zoltán Ésik:
Scattered Context-Free Linear Orderings. Developments in Language Theory 2011: 216-227 - [c51]Zoltán Ésik:
Multi-Linear Iterative K-Σ-Semialgebras. MFPS 2011: 159-170 - [i17]Zoltán Ésik:
Scattered context-free linear orderings. CoRR abs/1102.0850 (2011) - [i16]Zoltán Ésik:
Residuated Park Theories. CoRR abs/1102.1139 (2011) - [i15]Zoltán Ésik:
Multi-linear iterative K-Sigma-semialgebras. CoRR abs/1102.3106 (2011) - [i14]Zoltán Ésik, Szabolcs Iván:
Context-free ordinals. CoRR abs/1103.5421 (2011) - [i13]Zoltán Ésik, Satoshi Okawa:
On context-free languages of scattered words. CoRR abs/1111.3439 (2011) - 2010
- [j103]Stephen L. Bloom, Zoltán Ésik:
Algebraic Ordinals. Fundam. Informaticae 99(4): 383-407 (2010) - [j102]Zoltán Ésik, Pascal Weil:
Algebraic Characterization of Logically Defined Tree Languages. Int. J. Algebra Comput. 20(2): 195-239 (2010) - [j101]Erzsébet Csuhaj-Varjú, Zoltán Ésik:
Preface. Int. J. Found. Comput. Sci. 21(5): 687-688 (2010) - [j100]Zoltán Ésik:
Axiomatizing the equational theory of regular tree languages. J. Log. Algebraic Methods Program. 79(2): 189-213 (2010) - [j99]Stephen L. Bloom, Zoltán Ésik:
A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. 411(2): 341-359 (2010) - [j98]Erzsébet Csuhaj-Varjú, Zoltán Ésik:
Preface. Theor. Comput. Sci. 411(4-5): 701 (2010) - [c50]Zoltán Ésik, Szabolcs Iván:
On Müller Context-Free Grammars. Developments in Language Theory 2010: 173-184 - [c49]Zoltán Ésik, Andreas Maletti:
Simulation vs. Equivalence. FCS 2010: 119-124 - [c48]Zoltán Ésik, Andreas Maletti:
Simulations of Weighted Tree Automata. CIAA 2010: 321-330 - [c47]Zoltán Ésik:
Representing Small Ordinals by Finite Automata. DCFS 2010: 78-87 - [i12]Stephen L. Bloom, Zoltán Ésik:
Algebraic Linear Orderings. CoRR abs/1002.1624 (2010) - [i11]Zoltán Ésik:
An undecidable property of context-free languages. CoRR abs/1004.1736 (2010) - [i10]Zoltán Ésik, Andreas Maletti:
Simulation vs. Equivalence. CoRR abs/1004.2426 (2010) - [i9]Zoltán Ésik, Andreas Maletti:
Simulations of Weighted Tree Automata. CoRR abs/1005.2079 (2010) - [i8]Zoltán Ésik, Werner Kuich:
Free iterative and iteration K-semialgebras. CoRR abs/1008.1507 (2010) - [i7]Zoltán Ésik, Werner Kuich:
Free inductive K-semialgebras. CoRR abs/1009.4820 (2010)
2000 – 2009
- 2009
- [j97]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing rational power series over natural numbers. Inf. Comput. 207(7): 793-811 (2009) - [j96]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009) - [c46]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Cycle-Free Finite Automata in Partial Iterative Semirings. CAI 2009: 1-12 - [c45]Zoltán Ésik, Tamás Hajgató:
Iteration Grove Theories with Applications. CAI 2009: 227-249 - [c44]Stephen L. Bloom, Zoltán Ésik:
Scattered Algebraic Linear Orderings. FICS 2009: 25-29 - [c43]Zoltán Ésik, Szabolcs Iván:
Context-Free Languages of Countable Words. ICTAC 2009: 185-199 - [e9]Zoltán Ésik, Zoltán Fülöp:
Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday. Institute of Informatics, University of Szeged, Hungary 2009, ISBN 978-963-482-916-4 [contents] - [i6]Stephen L. Bloom, Zoltán Ésik:
Algebraic Ordinals. CoRR abs/0907.0877 (2009) - 2008
- [j95]Zoltán Ésik, Szabolcs Iván:
Products of Tree Automata with an Application to Temporal Logic. Fundam. Informaticae 82(1-2): 61-78 (2008) - [j94]Zoltán Ésik, Szabolcs Iván:
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Informaticae 82(1-2): 79-103 (2008) - [j93]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Partial Conway and Iteration Semirings. Fundam. Informaticae 86(1-2): 19-40 (2008) - [c42]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181 - [c41]Zoltán Ésik:
Iteration Semirings. Developments in Language Theory 2008: 1-20 - [c40]Zoltán Ésik, Szabolcs Iván:
Games for Temporal Logics on Trees. CIAA 2008: 191-200 - [e8]Erzsébet Csuhaj-Varjú, Zoltán Ésik:
Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings. 2008, ISBN 978-963-311-367-7 [contents] - 2007
- [j92]Zoltán Ésik, Guangwu Liu:
Fuzzy tree automata. Fuzzy Sets Syst. 158(13): 1450-1460 (2007) - [j91]Zoltán Ésik, Werner Kuich:
Boolean Fuzzy Sets. Int. J. Found. Comput. Sci. 18(6): 1197-1207 (2007) - [j90]Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. J. Autom. Lang. Comb. 12(4): 435-454 (2007) - [c39]Zoltán Ésik, Szabolcs Iván:
Aperiodicity in Tree Automata. CAI 2007: 189-207 - [c38]Stephen L. Bloom, Zoltán Ésik:
Regular and Algebraic Words and Ordinals. CALCO 2007: 1-15 - [c37]Zoltán Ésik, Gabriela Martín:
An Algebraic Characterization of Wolper's Logic. FCS 2007: 139-143 - [e7]Erzsébet Csuhaj-Varjú, Zoltán Ésik:
Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings. Lecture Notes in Computer Science 4639, Springer 2007, ISBN 978-3-540-74239-5 [contents] - [i5]Zoltán Ésik, Pascal Weil:
Algebraic characterization of logically defined tree languages. CoRR abs/0709.2962 (2007) - [i4]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing rational power series. CoRR abs/0712.1337 (2007) - [i3]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Partial Conway and iteration semirings. CoRR abs/0712.2952 (2007) - 2006
- [j89]Zoltán Ésik:
Preface. Acta Cybern. 17(4): 663 (2006) - [j88]Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 356(1-2): 1-5 (2006) - [j87]Zoltán Ésik:
Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. 356(1-2): 136-152 (2006) - [j86]Zoltán Ésik:
Preface. Theor. Comput. Sci. 366(3): 181 (2006) - [c36]Stephen L. Bloom, Zoltán Ésik:
Completing Categorical Algebras. IFIP TCS 2006: 231-249 - [e6]Zoltán Ésik:
Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings. Lecture Notes in Computer Science 4207, Springer 2006, ISBN 3-540-45458-6 [contents] - [e5]Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana:
Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence 25, Springer 2006, ISBN 978-3-540-33460-6 [contents] - [i2]Zoltán Ésik, Pascal Weil:
Algebraic recognizability of regular tree languages. CoRR abs/cs/0609113 (2006) - 2005
- [j85]Zoltán Ésik, Hans Leiß:
Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. 133(1-3): 173-203 (2005) - [j84]Stephen L. Bloom, Zoltán Ésik:
The equational theory of regular words. Inf. Comput. 197(1-2): 55-89 (2005) - [j83]Zoltán Ésik, Zoltán L. Németh:
Algebraic and graph-theoretic properties of infinite n-posets. RAIRO Theor. Informatics Appl. 39(1): 305-322 (2005) - [j82]Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages I. J. Autom. Lang. Comb. 10(2/3): 203-242 (2005) - [j81]Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages II. J. Autom. Lang. Comb. 10(2/3): 243-264 (2005) - [j80]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Zoltán Ésik:
Guest editors' foreword: Process Algebra. Theor. Comput. Sci. 335(2-3): 127-129 (2005) - [j79]Zoltán Ésik, Pascal Weil:
Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005) - [c35]Zoltán Ésik:
Cascade Products and Temporal Logics on Finite Trees. APC 25 2005: 163-166 - 2004
- [j78]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing omega and omega-op powers of words. RAIRO Theor. Informatics Appl. 38(1): 3-17 (2004) - [j77]Zoltán Ésik, Igor Walukiewicz:
Foreword. RAIRO Theor. Informatics Appl. 38(4): 275-276 (2004) - [j76]Zoltán Ésik, Zoltán L. Németh:
Higher Dimensional Automata. J. Autom. Lang. Comb. 9(1): 3-29 (2004) - [j75]Zoltán Ésik, Werner Kuich:
Inductive star-semirings. Theor. Comput. Sci. 324(1): 3-33 (2004) - [j74]Zoltán Ésik, Zoltán Fülöp:
Foreword. Theor. Comput. Sci. 327(3): 223-224 (2004) - [c34]Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of omega-Context-Free Languages. Theory Is Forever 2004: 68-80 - [c33]Zoltán Ésik, Werner Kuich:
An Algebraic Generalization of omega-Regular Languages. MFCS 2004: 648-659 - 2003
- [j73]Zoltán Ésik, Masami Ito:
Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata. Acta Cybern. 16(1): 1-28 (2003) - [j72]Janusz A. Brzozowski, Zoltán Ésik:
Hazard Algebras. Formal Methods Syst. Des. 23(3): 223-256 (2003) - [j71]Stephen L. Bloom, Zoltán Ésik:
Deciding whether the frontier of a regular tree is scattered. Fundam. Informaticae 55(1): 1-21 (2003) - [j70]Zoltán Ésik, Kim Guldstrand Larsen:
Regular languages definable by Lindström quantifiers. RAIRO Theor. Informatics Appl. 37(3): 179-241 (2003) - [j69]Zoltán Ésik, Anna Ingólfsdóttir:
Foreword. RAIRO Theor. Informatics Appl. 37(4): 272 (2003) - [j68]Stephen L. Bloom, Zoltán Ésik:
An Extension Theorem with an Application to Formal Tree Series. J. Autom. Lang. Comb. 8(2): 145-185 (2003) - [j67]Zoltán Ésik, Werner Kuich:
Formal Tree Series. J. Autom. Lang. Comb. 8(2): 219-285 (2003) - [j66]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
The max-plus algebra of the natural numbers has no finite equational basis. Theor. Comput. Sci. 293(1): 169-188 (2003) - [j65]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
Equational theories of tropical semirings. Theor. Comput. Sci. 298(3): 417-469 (2003) - [c32]Stephen L. Bloom, Zoltán Ésik:
Axioms for Regular Words: Extended Abstract. FSTTCS 2003: 50-61 - [c31]Zoltán Ésik, Pascal Weil:
On Logically Defined Recognizable Tree Languages. FSTTCS 2003: 195-207 - [e4]Zoltán Ésik, Zoltán Fülöp:
Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings. Lecture Notes in Computer Science 2710, Springer 2003, ISBN 3-540-40434-1 [contents] - [e3]Zoltán Ésik, Igor Walukiewicz:
FICS '03 - Fixed Points in Computer Science, Proceedings of an International Workshop, Warsaw, Poland, April 12-13, 2003. University of Warsaw 2003 [contents] - 2002
- [j64]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
A Fully Equational Proof of Parikh's Theorem. RAIRO Theor. Informatics Appl. 36(2): 129-153 (2002) - [j63]Zoltán Ésik, Werner Kuich:
Rationally Additive Semirings. J. Univers. Comput. Sci. 8(2): 173-183 (2002) - [j62]Zoltán Ésik:
Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. 12(2): 271-300 (2002) - [j61]Zoltán Ésik:
Axiomatizing the subsumption and subword preorders on finite and infinite partial words. Theor. Comput. Sci. 273(1-2): 225-248 (2002) - [c30]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
Equational Axioms for Probabilistic Bisimilarity. AMAST 2002: 239-253 - [c29]Zoltán Ésik, Hans Leiß:
Greibach Normal Form in Algebraically Complete Semirings. CSL 2002: 135-150 - [c28]Zoltán Ésik:
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. Developments in Language Theory 2002: 43-58 - [c27]Stephen L. Bloom, Zoltán Ésik:
Unique, guarded fixed points in an additive setting: Extended Abstract. CTCS 2002: 47-61 - [e2]Zoltán Ésik, Anna Ingólfsdóttir:
Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings. BRICS Notes Series NS-02-2, University of Aarhus 2002 [contents] - 2001
- [j60]Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes:
Iteration 2-theories. Appl. Categorical Struct. 9(2): 173-216 (2001) - [j59]Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
On Equations for Union-Free Regular Languages. Inf. Comput. 164(1): 152-172 (2001) - [j58]Pál Dömösi, Zoltán Ésik:
Homomorphic Simulation and Letichevsky's Criterion. J. Autom. Lang. Comb. 6(4): 427-436 (2001) - [c26]Zoltán Ésik, Werner Kuich:
A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets. Words, Semigroups, and Transductions 2001: 99-114 - [c25]Zoltán Ésik:
The Equational Theory of Fixed Points with Applications to Generalized Language Theory. Developments in Language Theory 2001: 21-36 - [c24]Zoltán Ésik, Zoltán L. Németh:
Automata on Series-Parallel Biposets. Developments in Language Theory 2001: 217-227 - [c23]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
Axiomatizing Tropical Semirings. FoSSaCS 2001: 42-56 - [c22]Janusz A. Brzozowski, Zoltán Ésik, Y. Iland:
Algebras for Hazard Detection. ISMVL 2001: 3-14 - 2000
- [j57]Zoltán Ésik:
The Power of the Group-Identities for Iteration. Int. J. Algebra Comput. 10(3): 349-374 (2000) - [j56]Zoltán Ésik, Werner Kuich:
A Kleene Theorem for Lindenmayerian Algebraic Power Series. J. Autom. Lang. Comb. 5(2): 109-122 (2000) - [j55]Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
The Variety of Kleene Algebras with Conversion is not Finitely Based. Theor. Comput. Sci. 230(1-2): 235-245 (2000) - [j54]Zoltán Ésik:
A proof of the Krohn-Rhodes Decomposition Theorem. Theor. Comput. Sci. 234(1-2): 287-300 (2000) - [c21]Zoltán Ésik:
Axiomatizing the Least Fixed Point Operation and Binary Supremum. CSL 2000: 302-316 - [c20]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376 - [c19]Zoltán Ésik:
Iteration Theories of Boolean Functions. MFCS 2000: 343-352 - [c18]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. STACS 2000: 267-278 - [p1]Janusz A. Brzozowski, Zoltán Ésik:
Hazard Algebras (Extended Abstract). A Half-Century of Automata Theory 2000: 1-19
1990 – 1999
- 1999
- [j53]Zoltán Ésik:
Axiomatizing Iteration Categories. Acta Cybern. 14(1): 65-82 (1999) - [j52]Zoltán Ésik:
Group Axioms for Iteration. Inf. Comput. 148(2): 131-180 (1999) - [j51]Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
A Note on Equations for Commutative Regular Languages. Inf. Process. Lett. 70(6): 265-267 (1999) - [c17]Zoltán Ésik, Satoshi Okawa:
Series and Parallel Operations on Pomsets. FSTTCS 1999: 316-328 - 1998
- [j50]Zoltán Ésik, Michael Bertol:
Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Informatica 35(6): 505-539 (1998) - [j49]Zoltán Ésik:
A Cayley Theorem for Ternary Algebras. Int. J. Algebra Comput. 8(3): 311-316 (1998) - [j48]L. Bernátsky, Zoltán Ésik:
Semantics on Flowchart Programs and the Free Conway Theories. RAIRO Theor. Informatics Appl. 32(1-3): 35-78 (1998) - [j47]Stephen L. Bloom, Zoltán Ésik:
Shuffle binoids. RAIRO Theor. Informatics Appl. 32(4-6): 175-198 (1998) - [j46]Zoltán Ésik, Anna Labella:
Equational Properties of Iteration in Algebraically Complete Categories. Theor. Comput. Sci. 195(1): 61-89 (1998) - [c16]Zoltán Ésik:
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). STACS 1998: 455-465 - 1997
- [j45]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139(1): 62-91 (1997) - [j44]Stephen L. Bloom, Zoltán Ésik:
Varieties Generated by Languages with Poset Operations. Math. Struct. Comput. Sci. 7(6): 701-713 (1997) - [j43]Zoltán Ésik:
Completeness of Park Induction. Theor. Comput. Sci. 177(1): 217-283 (1997) - [j42]Stephen L. Bloom, Zoltán Ésik:
The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179(1-2): 1-60 (1997) - [c15]Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes:
Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44 - 1996
- [j41]Stephen L. Bloom, Zoltán Ésik:
Two Axiomatizations of a Star Semiring Quasi-Variety. Bull. EATCS 59 (1996) - [j40]Stephen L. Bloom, Zoltán Ésik:
Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155(1): 1-38 (1996) - [j39]Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163(1&2): 55-98 (1996) - [c14]Zoltán Ésik, Anna Labella:
Equational Properties of Iteration in Algebraically Complete Categories. MFCS 1996: 336-347 - 1995
- [j38]Stephen L. Bloom, Zoltán Ésik:
Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. 6(2): 95-118 (1995) - [j37]Zoltán Ésik, L. Bernátsky:
Equational Properties of Kleene Algebras of Relations with Conversion. Theor. Comput. Sci. 137(2): 237-251 (1995) - [c13]Zoltán Ésik, Michael Bertol:
Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP 1995: 27-38 - [c12]Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN 1995: 99-111 - [c11]Stephen L. Bloom, Zoltán Ésik:
Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT 1995: 318-333 - [c10]Zoltán Ésik, L. Bernátsky:
Scott induction and equational proofs. MFPS 1995: 154-181 - 1994
- [c9]Stephen L. Bloom, Zoltán Ésik:
Solving Polynomial Fixed Point Equations. MFCS 1994: 52-67 - 1993
- [b1]Stephen L. Bloom, Zoltán Ésik:
Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science, Springer 1993, ISBN 978-3-642-78036-3, pp. i-xv, 1-632 - [j36]Stephen L. Bloom, Zoltán Ésik, Dirk Taubner:
Iteration Theories of Synchronization Trees. Inf. Comput. 102(1): 1-55 (1993) - [j35]Stephen L. Bloom, Zoltán Ésik:
Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. 4(1): 99 (1993) - [j34]Stephen L. Bloom, Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. 46(3): 381-408 (1993) - [j33]Stephen L. Bloom, Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. 46(3): 409-439 (1993) - [j32]Stephen L. Bloom, Zoltán Ésik:
Equational Axioms for Regular Sets. Math. Struct. Comput. Sci. 3(1): 1-24 (1993) - [c8]Stephen L. Bloom, Zoltán Ésik:
Some Quasi-Varieties of Iteration Theories. MFPS 1993: 378-409 - [e1]Zoltán Ésik:
Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings. Lecture Notes in Computer Science 710, Springer 1993, ISBN 3-540-57163-9 [contents] - 1992
- [j31]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras. Int. J. Found. Comput. Sci. 3(3): 245-302 (1992) - 1991
- [j30]Zoltán Ésik:
A note on isomorphic simulation of automata by networks of two-state automata. Discret. Appl. Math. 30(1): 77-82 (1991) - [j29]Stephen L. Bloom, Zoltán Ésik:
Cayley iff Stone. Bull. EATCS 43: 159-161 (1991) - [j28]Stephen L. Bloom, Zoltán Ésik:
Floyd-Hoare Logic in Iteration Theories. J. ACM 38(4): 887-934 (1991) - [j27]Zoltán Ésik:
Results on Homomorphic Realization of Automata by alpha_0-Products. Theor. Comput. Sci. 87(2): 229-249 (1991) - [c7]Stephen L. Bloom, Zoltán Ésik:
Program Correctness and Matricial Iteration Theories. MFPS 1991: 457-476 - [c6]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 1991: 264-274 - 1990
- [j26]Pál Dömösi, Zoltán Ésik:
Product hierarchies of automata and homomorphic simulation. Acta Cybern. 9(4): 371-373 (1990) - [j25]Zoltán Ésik:
A note on the axiomatization of iteration theories. Acta Cybern. 9(4): 375-384 (1990) - [i1]Stephen L. Bloom, Zoltán Ésik, Dirk Taubner:
Iteration theories of synchronization trees. Forschungsberichte, TU Munich TUM I 9014: 1-60 (1990)
1980 – 1989
- 1989
- [j24]Stephen L. Bloom, Zoltán Ésik:
Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. 63(3): 303-331 (1989) - [c5]Pál Dömösi, Zoltán Ésik, Balázs Imreh:
On Product Hierarchies of Automata. FCT 1989: 137-144 - 1988
- [j23]Pál Dömösi, Zoltán Ésik:
On the hierarchy of νi-product. Acta Cybern. 8(3): 253-257 (1988) - [j22]Pál Dömösi, Zoltán Ésik:
On homomorphic simulation of automata by α0-products. Acta Cybern. 8(4): 315-323 (1988) - [j21]Zoltán Ésik:
Independence of the Equational Axioms for Iteration Theories. J. Comput. Syst. Sci. 36(1): 66-76 (1988) - [j20]Stephen L. Bloom, Zoltán Ésik:
Varieties of Iteration Theories. SIAM J. Comput. 17(5): 939-966 (1988) - [j19]Pál Dömösi, Zoltán Ésik:
Critical Classes for the alpha_0-Product. Theor. Comput. Sci. 61: 17-24 (1988) - [c4]Zoltán Ésik:
An Extension of the Krohn-Rhodes Decomposition of Automata. IMYCS 1988: 66-71 - 1987
- [j18]Zoltán Ésik, J. Virágh:
A note on α0* - products of aperiodic automata. Acta Cybern. 8(1): 41-43 (1987) - [j17]Zoltán Ésik:
Loop products and loop-free products. Acta Cybern. 8(1): 45-48 (1987) - [j16]Zoltán Ésik:
On isomorphic realization of automata with α0-products. Acta Cybern. 8(2): 119-127 (1987) - [j15]Zoltán Ésik, Ferenc Gécseg:
On a Representation of Tree Automata. Theor. Comput. Sci. 53: 243-255 (1987) - 1986
- [j14]Zoltán Ésik:
Varieties and general products of top-down algebras. Acta Cybern. 7(3): 293-298 (1986) - [j13]Zoltán Ésik, J. Virágh:
On products of automata with identity. Acta Cybern. 7(3): 299-311 (1986) - [j12]Zoltán Ésik, Pál Dömösi:
Complete Classes of Automata for the alpha-0-Product. Theor. Comput. Sci. 47(3): 1-14 (1986) - [j11]Zoltán Ésik, Ferenc Gécseg:
On alpha-0-Products and alpha-2-Products. Theor. Comput. Sci. 48(3): 1-8 (1986) - [c3]Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh:
Homomorphic Realizations of Automata with Compositions. MFCS 1986: 299-307 - 1985
- [j10]Zoltán Ésik:
On the weak equivalence of Elgot's flow-chart schemata. Acta Cybern. 7(2): 147-154 (1985) - [j9]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. 31(3): 375-393 (1985) - 1984
- [j8]Stephen L. Bloom, Zoltán Ésik:
Some varieties of iteration theories. Bull. EATCS 24: 53-65 (1984) - 1983
- [j7]Zoltán Ésik, Ferenc Gécseg:
General products and equational classes of automata. Acta Cybern. 6(3): 281-284 (1983) - [j6]Zoltán Ésik:
Decidability results concerning tree transducers II. Acta Cybern. 6(3): 303-314 (1983) - [j5]Zoltán Ésik:
Algebras of Iteration Theories. J. Comput. Syst. Sci. 27(2): 291-303 (1983) - 1981
- [j4]Zoltán Ésik, Balázs Imreh:
Remarks on finite commutative automata. Acta Cybern. 5(2): 143-146 (1981) - [j3]Zoltán Ésik, Balázs Imreh:
Subdirectly irreducible commutative automata. Acta Cybern. 5(3): 251-260 (1981) - [c2]Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. FCT 1981: 130-136 - 1980
- [j2]Zoltán Ésik:
Decidability results concerning tree transducers I. Acta Cybern. 5(1): 1-20 (1980)
1970 – 1979
- 1979
- [c1]Zoltán Ésik:
On functional tree transducers. FCT 1979: 121-127 - 1976
- [j1]Zoltán Ésik:
On two problems of A. Salomaa. Acta Cybern. 2(4): 299-306 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
