Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zoltán Ésik
2010 – today
- 2013
[j116]Arnaud Carayol, Zoltán Ésik: The FC-rank of a context-free language. Inf. Process. Lett. 113(8): 285-287 (2013)
[j115]Zoltán Ésik, Werner Kuich: Free inductive K-semialgebras. J. Log. Algebr. Program. 82(3-4): 111-122 (2013)
[c57]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas: Kleene Algebras and Semimodules for Energy Problems. ATVA 2013: 102-117
[c56]Zoltán Ésik, Szabolcs Iván: Operational Characterization of Scattered MCFLs. Developments in Language Theory 2013: 215-226
[i21]
[i20]Zoltán Ésik, Szabolcs Iván: Operational characterization of scattered MCFLs -- Technical Report. CoRR abs/1304.6388 (2013)
[i19]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas: Kleene Algebras and Semimodules for Energy Problems. CoRR abs/1307.0635 (2013)
[i18]Manfred Droste, Zoltán Ésik, Werner Kuich: Conway and iteration hemirings. CoRR abs/1307.0725 (2013)- 2012
[j114]Zoltán Ésik: Ordinal Automata and Cantor Normal Form. Int. J. Found. Comput. Sci. 23(1): 87-98 (2012)
[j113]
[j112]
[c55]Zoltán Ésik, Satoshi Okawa: On Context-Free Languages of Scattered Words. Developments in Language Theory 2012: 142-153
[c54]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir: Algebraic Synchronization Trees and Processes. ICALP (2) 2012: 30-41
[c53]Arnaud Carayol, Zoltán Ésik: A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS 2012: 104-118
[c52]Zoltán Ésik, Szabolcs Iván: Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN 2012: 291-302
[e9]Dale Miller, Zoltán Ésik (Eds.): Proceedings 8th Workshop on Fixed Points in Computer Science. EPTCS 77, 2012
[i17]- 2011
[j111]Zoltán Ésik: Multi-Linear Iterative K-Σ-Semialgebras. Electr. Notes Theor. Comput. Sci. 276: 159-170 (2011)
[j110]
[j109]Stephen L. Bloom, Zoltán Ésik: Algebraic Linear Orderings. Int. J. Found. Comput. Sci. 22(2): 491-515 (2011)
[j108]Zoltán Ésik, Andreas Maletti: The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. 22(8): 1845-1859 (2011)
[j107]Zoltán Ésik: An undecidable property of context-free linear orders. Inf. Process. Lett. 111(3): 107-109 (2011)
[j106]Zoltán Ésik, Tamás Hajgató: Dagger extension theorem. Mathematical Structures in Computer Science 21(5): 1035-1066 (2011)
[j105]Zoltán Ésik, Szabolcs Iván: Büchi context-free languages. Theor. Comput. Sci. 412(8-10): 805-821 (2011)
[c51]Zoltán Ésik: Partial Conway and Iteration Semiring-Semimodule Pairs. Algebraic Foundations in Computer Science 2011: 56-71
[c50]Zoltán Ésik, Tamás Hajgató: Kleene Theorem in Partial Conway Theories with Applications. Algebraic Foundations in Computer Science 2011: 72-93
[c49]Zoltán Ésik, Werner Kuich: A Unifying Kleene Theorem for Weighted Finite Automata. Rainbow of Computer Science 2011: 76-89
[c48]
[i16]
[i15]
[i14]
[i13]
[i12]- 2010
[j104]
[j103]Zoltán Ésik, Pascal Weil: Algebraic Characterization of Logically Defined Tree Languages. IJAC 20(2): 195-239 (2010)
[j102]
[j101]Zoltán Ésik: Axiomatizing the equational theory of regular tree languages. J. Log. Algebr. Program. 79(2): 189-213 (2010)
[j100]Stephen L. Bloom, Zoltán Ésik: A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. 411(2): 341-359 (2010)
[j99]
[c47]Zoltán Ésik, Szabolcs Iván: On Müller Context-Free Grammars. Developments in Language Theory 2010: 173-184
[c46]
[c45]
[c44]
[i11]
[i10]
[i9]
[i8]
[i7]
[i6]
2000 – 2009
- 2009
[j98]Stephen L. Bloom, Zoltán Ésik: Axiomatizing rational power series over natural numbers. Inf. Comput. 207(7): 793-811 (2009)
[j97]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009)
[c43]Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Cycle-Free Finite Automata in Partial Iterative Semirings. CAI 2009: 1-12
[c42]
[c41]
[e8]Zoltán Ésik, Zoltán Fülöp (Eds.): 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
[i5]- 2008
[j96]Zoltán Ésik, Szabolcs Iván: Products of Tree Automata with an Application to Temporal Logic. Fundam. Inform. 82(1-2): 61-78 (2008)
[j95]Zoltán Ésik, Szabolcs Iván: Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Inform. 82(1-2): 79-103 (2008)
[j94]Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and Iteration Semirings. Fundam. Inform. 86(1-2): 19-40 (2008)
[c40]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181
[c39]
[c38]
[e7]Erzsébet Csuhaj-Varjú, Zoltán Ésik (Eds.): Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings. 2008, ISBN 978-963-311-367-7- 2007
[j93]
[j92]
[j91]Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. Journal of Automata, Languages and Combinatorics 12(4): 435-454 (2007)
[c37]
[c36]
[c35]
[e6]Erzsébet Csuhaj-Varjú, Zoltán Ésik (Eds.): 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
[i4]Zoltán Ésik, Pascal Weil: Algebraic characterization of logically defined tree languages. CoRR abs/0709.2962 (2007)
[i3]
[i2]Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and iteration semirings. CoRR abs/0712.2952 (2007)- 2006
[j90]
[j89]Zoltán Ésik: Cascade Products and Temporal Logics on Finite Trees. Electr. Notes Theor. Comput. Sci. 162: 163-166 (2006)
[j88]
[j87]Zoltán Ésik: Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. 356(1-2): 136-152 (2006)
[j86]
[c34]
[e5]Zoltán Ésik (Ed.): 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
[e4]Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana (Eds.): Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence 25, Springer 2006, ISBN 978-3-540-33460-6
[i1]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. Logic 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. ITA 39(1): 305-322 (2005)
[j82]Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of ?-Regular Languages I. Journal of Automata, Languages and Combinatorics 10(2/3): 203-242 (2005)
[j81]Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of ?-Regular Languages II. Journal of Automata, Languages and Combinatorics 10(2/3): 243-264 (2005)
[j80]Luca Aceto, Wan 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)- 2004
[j78]Stephen L. Bloom, Zoltán Ésik: Axiomatizing omega and omega-op powers of words. ITA 38(1): 3-17 (2004)
[j77]
[j76]Zoltán Ésik, Zoltán L. Németh: Higher Dimensional Automata. Journal of Automata, Languages and Combinatorics 9(1): 3-29 (2004)
[j75]
[j74]
[c33]Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of omega-Context-Free Languages. Theory Is Forever 2004: 68-80
[c32]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 in System Design 23(3): 223-256 (2003)
[j71]Stephen L. Bloom, Zoltán Ésik: Deciding whether the frontier of a regular tree is scattered. Fundam. Inform. 55(1): 1-21 (2003)
[j70]Zoltán Ésik, Kim Guldstrand Larsen: Regular languages definable by Lindström quantifiers. ITA 37(3): 179-241 (2003)
[j69]
[j68]Stephen L. Bloom, Zoltán Ésik: An Extension Theorem with an Application to Formal Tree Series. Journal of Automata, Languages and Combinatorics 8(2): 145-185 (2003)
[j67]Zoltán Ésik, Werner Kuich: Formal Tree Series. Journal of Automata, Languages and Combinatorics 8(2): 219-285 (2003)
[j66]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational theories of tropical semirings. Theor. Comput. Sci. 3(298): 417-469 (2003)
[c31]
[c30]
[e3]Zoltán Ésik, Zoltán Fülöp (Eds.): 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- 2002
[j65]Stephen L. Bloom, Zoltán Ésik: Unique, guarded fixed points in an additive setting: Extended Abstract. Electr. Notes Theor. Comput. Sci. 69: 47-61 (2002)
[j64]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: A Fully Equational Proof of Parikh's Theorem. ITA 36(2): 129-153 (2002)
[j63]
[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)
[c29]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational Axioms for Probabilistic Bisimilarity. AMAST 2002: 239-253
[c28]
[c27]Zoltán Ésik: Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. Developments in Language Theory 2002: 43-58
[e2]Zoltán Ésik, Anna Ingólfsdóttir (Eds.): 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- 2001
[j60]Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes: Iteration 2-theories. Applied Categorical Structures 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. Journal of Automata, Languages and Combinatorics 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]
[c22]- 2000
[j57]
[j56]Zoltán Ésik, Werner Kuich: A Kleene Theorem for Lindenmayerian Algebraic Power Series. Journal of Automata, Languages and Combinatorics 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]
[c20]Janusz A. Brzozowski, Zoltán Ésik: Hazard Algebras (Extended Abstract). A Half-Century of Automata Theory 2000: 1-19
[c19]Stephen L. Bloom, Zoltán Ésik: Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376
[c18]
[c17]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
1990 – 1999
- 1999
[j53]
[j52]
[j51]Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik: A Note on Equations for Commutative Regular Languages. Inf. Process. Lett. 70(6): 265-267 (1999)
[c16]- 1998
[j50]Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Inf. 35(6): 505-539 (1998)
[j49]
[j48]L. Bernátsky, Zoltán Ésik: Semantics on Flowchart Programs and the Free Conway Theories. ITA 32(1-3): 35-78 (1998)
[j47]Zoltán Ésik, Anna Labella: Equational Properties of Iteration in Algebraically Complete Categories. Theor. Comput. Sci. 195(1): 61-89 (1998)
[c15]Zoltán Ésik: Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). STACS 1998: 455-465- 1997
[j46]Stephen L. Bloom, Zoltán Ésik: Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139(1): 62-91 (1997)
[j45]Stephen L. Bloom, Zoltán Ésik: Varieties Generated by Languages with Poset Operations. Mathematical Structures in Computer Science 7(6): 701-713 (1997)
[j44]
[j43]Stephen L. Bloom, Zoltán Ésik: The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179(1-2): 1-60 (1997)
[c14]Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes: Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44- 1996
[j42]Stephen L. Bloom, Zoltán Ésik: Two Axiomatizations of a Star Semiring Quasi-Variety. Bulletin of the EATCS 59 (1996)
[j41]Stephen L. Bloom, Zoltán Ésik: Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155(1): 1-38 (1996)
[j40]Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163(1&2): 55-98 (1996)
[c13]Zoltán Ésik, Anna Labella: Equational Properties of Iteration in Algebraically Complete Categories. MFCS 1996: 336-347- 1995
[j39]Zoltán Ésik, L. Bernátsky: Scott induction and equational proofs. Electr. Notes Theor. Comput. Sci. 1: 154-181 (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)
[c12]Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP 1995: 27-38
[c11]Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN 1995: 99-111
[c10]Stephen L. Bloom, Zoltán Ésik: Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT 1995: 318-333- 1994
[c9]- 1993
[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. Mathematical Structures in Computer Science 3(1): 1-24 (1993)
[c8]
[e1]Zoltán Ésik (Ed.): 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- 1992
[j31]- 1991
[j30]Zoltán Ésik: A note on isomorphic simulation of automata by networks of two-state automata. Discrete Applied Mathematics 30(1): 77-82 (1991)
[j29]
[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]- 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]
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]- 1988
[j23]
[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]- 1987
[j18]Zoltán Ésik, J. Virágh: A note on α0* - products of aperiodic automata. Acta Cybern. 8(1): 41-43 (1987)
[j17]
[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]
[j13]
[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. Bulletin of the 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]
[j5]- 1981
[j4]
[j3]Zoltán Ésik, Balázs Imreh: Remarks on finite commutative automata. Acta Cybern. 5(2): 143-146 (1981)
[j2]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
1970 – 1979
- 1979
[c1]- 1976
[j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:24 CEST by the dblp team



