The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zoltán Ésik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
    Equational Axioms for Probabilistic Bisimilarity. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:239-253 [Conf]
  2. Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes
    Iteration 2-Theories: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    AMAST, 1997, pp:30-44 [Conf]
  3. Zoltán Ésik, Werner Kuich
    A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:99-114 [Conf]
  4. Zoltán Ésik, Werner Kuich
    A Semiring-Semimodule Generalization of omega-Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:68-80 [Conf]
  5. Zoltán Ésik
    Axiomatizing the Least Fixed Point Operation and Binary Supremum. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:302-316 [Conf]
  6. Zoltán Ésik, Hans Leiß
    Greibach Normal Form in Algebraically Complete Semirings. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:135-150 [Conf]
  7. Zoltán Ésik
    The Equational Theory of Fixed Points with Applications to Generalized Language Theory. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:21-36 [Conf]
  8. Zoltán Ésik
    Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:43-58 [Conf]
  9. Zoltán Ésik, Zoltán L. Németh
    Automata on Series-Parallel Biposets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:217-227 [Conf]
  10. Zoltán Ésik
    On functional tree transducers. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:121-127 [Conf]
  11. Zoltán Ésik
    An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:130-136 [Conf]
  12. Pál Dömösi, Zoltán Ésik, Balázs Imreh
    On Product Hierarchies of Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:137-144 [Conf]
  13. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
    Axiomatizing Tropical Semirings. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:42-56 [Conf]
  14. Stephen L. Bloom, Zoltán Ésik
    Axioms for Regular Words: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:50-61 [Conf]
  15. Zoltán Ésik, Satoshi Okawa
    Series and Parallel Operations on Pomsets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:316-328 [Conf]
  16. Zoltán Ésik, Pascal Weil
    On Logically Defined Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:195-207 [Conf]
  17. Janusz A. Brzozowski, Zoltán Ésik
    Hazard Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    A Half-Century of Automata Theory, 2000, pp:1-19 [Conf]
  18. Zoltán Ésik, Michael Bertol
    Nonfinite Axiomatizability of the Equational Theory of Shuffle. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:27-38 [Conf]
  19. Zoltán Ésik
    An Extension of the Krohn-Rhodes Decomposition of Automata. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1988, pp:66-71 [Conf]
  20. Janusz A. Brzozowski, Zoltán Ésik, Y. Iland
    Algebras for Hazard Detection. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2001, pp:3-0 [Conf]
  21. Stephen L. Bloom, Zoltán Ésik
    Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:367-376 [Conf]
  22. Stephen L. Bloom, Zoltán Ésik
    Free Shuffle Algebras in Language Varieties (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:99-111 [Conf]
  23. Stephen L. Bloom, Zoltán Ésik
    Solving Polynomial Fixed Point Equations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:52-67 [Conf]
  24. Zoltán Ésik
    Iteration Theories of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:343-352 [Conf]
  25. Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
    Homomorphic Realizations of Automata with Compositions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:299-307 [Conf]
  26. Zoltán Ésik, Werner Kuich
    An Algebraic Generalization of omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:648-659 [Conf]
  27. Zoltán Ésik, Anna Labella
    Equational Properties of Iteration in Algebraically Complete Categories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:336-347 [Conf]
  28. Stephen L. Bloom, Zoltán Ésik
    Program Correctness and Matricial Iteration Theories. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:457-476 [Conf]
  29. Stephen L. Bloom, Zoltán Ésik
    Some Quasi-Varieties of Iteration Theories. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:378-409 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:267-278 [Conf]
  31. Zoltán Ésik
    Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:455-465 [Conf]
  32. Stephen L. Bloom, Zoltán Ésik
    Iteration Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:264-274 [Conf]
  33. Stephen L. Bloom, Zoltán Ésik
    Nonfinite Axiomatizability of Shuffle Inequalities. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:318-333 [Conf]
  34. Zoltán Ésik, Michael Bertol
    Nonfinite Axiomatizability of the Equational Theory of Shuffle. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:6, pp:505-539 [Journal]
  35. Pál Dömösi, Zoltán Ésik
    On the hiearchy of nui-product. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1988, v:8, n:, pp:253-257 [Journal]
  36. Pál Dömösi, Zoltán Ésik
    On homomorphic simulation of automata by alphai-producst. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1988, v:8, n:, pp:315-323 [Journal]
  37. Pál Dömösi, Zoltán Ésik
    Product hierarchies of automata and homomorphic simulation. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1990, v:9, n:4, pp:371-373 [Journal]
  38. Zoltán Ésik
    On two problems of A. Salomaa. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1976, v:2, n:, pp:299-306 [Journal]
  39. Zoltán Ésik
    Decidability results concerning tree transducers I. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:1-20 [Journal]
  40. Zoltán Ésik
    Decidability results concerning tree transducers II. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1984, v:6, n:, pp:303-314 [Journal]
  41. Zoltán Ésik
    On the weak equivalence of Elgot's flow-chart schemata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1985, v:7, n:2, pp:147-154 [Journal]
  42. Zoltán Ésik
    Varieties and general products of top-down algebras. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1986, v:7, n:3, pp:293-298 [Journal]
  43. Zoltán Ésik
    Loop products and loop-free products. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:45-48 [Journal]
  44. Zoltán Ésik
    On isomorphic realization of automata with alphai-products. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:119-127 [Journal]
  45. Zoltán Ésik
    A note on the axiomatization of iteration theories. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1990, v:9, n:4, pp:375-384 [Journal]
  46. Zoltán Ésik
    Axiomatizing Iteration Categories. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1999, v:14, n:1, pp:65-82 [Journal]
  47. Zoltán Ésik, Ferenc Gécseg
    General products and equational classes of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1984, v:6, n:, pp:281-284 [Journal]
  48. Zoltán Ésik, Masami Ito
    Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2003, v:16, n:1, pp:1-28 [Journal]
  49. Zoltán Ésik, Balázs Imreh
    Remarks on finite commutative automat. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:143-146 [Journal]
  50. Zoltán Ésik, Balázs Imreh
    Subdirectly irreducible commutative automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:251-260 [Journal]
  51. Zoltán Ésik, J. Virágh
    On products of automata with identity. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1986, v:7, n:3, pp:299-311 [Journal]
  52. Zoltán Ésik, J. Virágh
    A note on alpha0* - products of aperiodic automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:41-43 [Journal]
  53. Zoltán Ésik, Hans Leiß
    Algebraically complete semirings and Greibach normal form. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:173-203 [Journal]
  54. Stephen L. Bloom, Zoltán Ésik
    Some varieties of iteration theories. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:24, n:, pp:53-65 [Journal]
  55. Stephen L. Bloom, Zoltán Ésik
    Two Axiomatizations of a Star Semiring Quasi-Variety. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:59, n:, pp:- [Journal]
  56. Stephen L. Bloom, Zoltán Ésik
    Cayley iff Stone. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:43, n:, pp:159-161 [Journal]
  57. Stephen L. Bloom, Zoltán Ésik
    Unique, guarded fixed points in an additive setting: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:69, n:, pp:- [Journal]
  58. Zoltán Ésik, L. Bernátsky
    Scott induction and equational proofs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal]
  59. Zoltán Ésik
    Cascade Products and Temporal Logics on Finite Trees. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:163-166 [Journal]
  60. Janusz A. Brzozowski, Zoltán Ésik
    Hazard Algebras. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2003, v:23, n:3, pp:223-256 [Journal]
  61. Stephen L. Bloom, Zoltán Ésik
    Deciding whether the frontier of a regular tree is scattered. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:1, pp:1-21 [Journal]
  62. Stephen L. Bloom, Zoltán Ésik
    The equational theory of regular words. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:197, n:1-2, pp:55-89 [Journal]
  63. Stephen L. Bloom, Zoltán Ésik
    Axiomatizing Shuffle and Concatenation in Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:62-91 [Journal]
  64. Stephen L. Bloom, Zoltán Ésik, Dirk Taubner
    Iteration Theories of Synchronization Trees [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:1, pp:1-55 [Journal]
  65. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
    On Equations for Union-Free Regular Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:164, n:1, pp:152-172 [Journal]
  66. Zoltán Ésik
    Group Axioms for Iteration. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:148, n:2, pp:131-180 [Journal]
  67. Zoltán Ésik
    The Power of the Group-Identities for Iteration. [Citation Graph (0, 0)][DBLP]
    IJAC, 2000, v:10, n:3, pp:349-374 [Journal]
  68. Stephen L. Bloom, Zoltán Ésik
    Erratum: Iteration Algebras. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:1, pp:99- [Journal]
  69. Stephen L. Bloom, Zoltán Ésik
    Some Equational Laws of Initiality in 2CCC's. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:95-118 [Journal]
  70. Stephen L. Bloom, Zoltán Ésik
    Iteration Algebras. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:3, pp:245-302 [Journal]
  71. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
    A Note on Equations for Commutative Regular Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:6, pp:265-267 [Journal]
  72. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
    A Fully Equational Proof of Parikh's Theorem. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:2, pp:129-153 [Journal]
  73. L. Bernátsky, Zoltán Ésik
    Semantics on Flowchart Programs and the Free Conway Theories. [Citation Graph (0, 0)][DBLP]
    ITA, 1998, v:32, n:1-3, pp:35-78 [Journal]
  74. Zoltán Ésik, Anna Ingólfsdóttir
    Foreword. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:4, pp:272- [Journal]
  75. Zoltán Ésik, Kim Guldstrand Larsen
    Regular languages definable by Lindström quantifiers. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:3, pp:179-241 [Journal]
  76. Stephen L. Bloom, Zoltán Ésik
    Floyd-Hoare Logic in Iteration Theories. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:4, pp:887-934 [Journal]
  77. Stephen L. Bloom, Zoltán Ésik
    An Extension Theorem with an Application to Formal Tree Series. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:2, pp:145-185 [Journal]
  78. Pál Dömösi, Zoltán Ésik
    Homomorphic Simulation and Letichevsky's Criterion. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:427-436 [Journal]
  79. Zoltán Ésik, Zoltán L. Németh
    Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:3-29 [Journal]
  80. Zoltán Ésik, Werner Kuich
    A Kleene Theorem for Lindenmayerian Algebraic Power Series. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:2, pp:109-122 [Journal]
  81. Zoltán Ésik, Werner Kuich
    Formal Tree Series. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:2, pp:219-285 [Journal]
  82. Stephen L. Bloom, Zoltán Ésik
    Axiomatizing Schemes and Their Behaviors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:3, pp:375-393 [Journal]
  83. Stephen L. Bloom, Zoltán Ésik
    Matrix and Matricial Iteration Theories, Part I. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:381-408 [Journal]
  84. Stephen L. Bloom, Zoltán Ésik
    Matrix and Matricial Iteration Theories, Part II. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:409-439 [Journal]
  85. Zoltán Ésik
    Algebras of Iteration Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:2, pp:291-303 [Journal]
  86. Zoltán Ésik
    Independence of the Equational Axioms for Iteration Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:1, pp:66-76 [Journal]
  87. Zoltán Ésik, Werner Kuich
    Rationally Additive Semirings. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:173-183 [Journal]
  88. Zoltán Ésik
    Continuous Additive Algebras and Injective Simulations of Synchronization Trees. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:2, pp:271-300 [Journal]
  89. Stephen L. Bloom, Zoltán Ésik
    Equational Axioms for Regular Sets. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1993, v:3, n:1, pp:1-24 [Journal]
  90. Stephen L. Bloom, Zoltán Ésik
    Varieties Generated by Languages with Poset Operations. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:6, pp:701-713 [Journal]
  91. Stephen L. Bloom, Zoltán Ésik
    Varieties of Iteration Theories. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:939-966 [Journal]
  92. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
    Equational theories of tropical semirings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:3, n:298, pp:417-469 [Journal]
  93. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik
    Guest editors' foreword: Process Algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:127-129 [Journal]
  94. Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:1-5 [Journal]
  95. Stephen L. Bloom, Zoltán Ésik
    Equational Logic of Circular Data Type Specification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:3, pp:303-331 [Journal]
  96. Stephen L. Bloom, Zoltán Ésik
    Fixed-Point Operations on ccc's. Part I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:1-38 [Journal]
  97. Stephen L. Bloom, Zoltán Ésik
    Free Shuffle Algebras in Language Varieties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:55-98 [Journal]
  98. Stephen L. Bloom, Zoltán Ésik
    The Equational Logic of Fixed Points (Tutorial). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:179, n:1-2, pp:1-60 [Journal]
  99. Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik
    The Variety of Kleene Algebras with Conversion is not Finitely Based. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:235-245 [Journal]
  100. Pál Dömösi, Zoltán Ésik
    Critical Classes for the alpha_0-Product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:17-24 [Journal]
  101. Zoltán Ésik
    A proof of the Krohn-Rhodes Decomposition Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:287-300 [Journal]
  102. Zoltán Ésik
    Axiomatizing the subsumption and subword preorders on finite and infinite partial words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:225-248 [Journal]
  103. Zoltán Ésik
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:181- [Journal]
  104. Zoltán Ésik
    Characterizing CTL-like logics on finite trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:136-152 [Journal]
  105. Zoltán Ésik
    Results on Homomorphic Realization of Automata by alpha_0-Products. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:87, n:2, pp:229-249 [Journal]
  106. Zoltán Ésik
    Completeness of Park Induction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:177, n:1, pp:217-283 [Journal]
  107. Zoltán Ésik, L. Bernátsky
    Equational Properties of Kleene Algebras of Relations with Conversion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:237-251 [Journal]
  108. Zoltán Ésik, Pál Dömösi
    Complete Classes of Automata for the alpha-0-Product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:1-14 [Journal]
  109. Zoltán Ésik, Zoltán Fülöp
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:3, pp:223-224 [Journal]
  110. Zoltán Ésik, Ferenc Gécseg
    On alpha-0-Products and alpha-2-Products. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:1-8 [Journal]
  111. Zoltán Ésik, Ferenc Gécseg
    On a Representation of Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:243-255 [Journal]
  112. Zoltán Ésik, Werner Kuich
    Inductive star-semirings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:1, pp:3-33 [Journal]
  113. Zoltán Ésik, Anna Labella
    Equational Properties of Iteration in Algebraically Complete Categories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:1, pp:61-89 [Journal]
  114. Zoltán Ésik, Pascal Weil
    Algebraic recognizability of regular tree languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:291-321 [Journal]
  115. Stephen L. Bloom, Zoltán Ésik
    Regular and Algebraic Words and Ordinals. [Citation Graph (0, 0)][DBLP]
    CALCO, 2007, pp:1-15 [Conf]
  116. Zoltán Ésik, Pascal Weil
    Algebraic recognizability of regular tree languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  117. Zoltán Ésik, Pascal Weil
    Algebraic characterization of logically defined tree languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  118. Zoltán Ésik, Guangwu Liu
    Fuzzy tree automata. [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2007, v:158, n:13, pp:1450-1460 [Journal]

  119. Iteration Semirings. [Citation Graph (, )][DBLP]


  120. On Müller Context-Free Grammars. [Citation Graph (, )][DBLP]


  121. An Algebraic Characterization of Wolper's Logic. [Citation Graph (, )][DBLP]


  122. Context-Free Languages of Countable Words. [Citation Graph (, )][DBLP]


  123. Completing Categorical Algebras. [Citation Graph (, )][DBLP]


  124. Games for Temporal Logics on Trees. [Citation Graph (, )][DBLP]


  125. Aperiodicity in Tree Automata. [Citation Graph (, )][DBLP]


  126. Iteration Grove Theories with Applications. [Citation Graph (, )][DBLP]


  127. Cycle-Free Finite Automata in Partial Iterative Semirings. [Citation Graph (, )][DBLP]


  128. Iteration 2-theories. [Citation Graph (, )][DBLP]


  129. Preface. [Citation Graph (, )][DBLP]


  130. Axiomatizing rational power series [Citation Graph (, )][DBLP]


  131. Partial Conway and iteration semirings [Citation Graph (, )][DBLP]


  132. Algebraic Ordinals [Citation Graph (, )][DBLP]


  133. Algebraic Linear Orderings [Citation Graph (, )][DBLP]


  134. An undecidable property of context-free languages [Citation Graph (, )][DBLP]


  135. Simulation vs. Equivalence [Citation Graph (, )][DBLP]


  136. Simulations of Weighted Tree Automata [Citation Graph (, )][DBLP]


  137. Free iterative and iteration K-semialgebras [Citation Graph (, )][DBLP]


  138. Representing Small Ordinals by Finite Automata [Citation Graph (, )][DBLP]


  139. A note on isomorphic simulation of automata by networks of two-state automata. [Citation Graph (, )][DBLP]


Search in 0.278secs, Finished in 0.282secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002