. . .
About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors
Departments:
- Image Processing and Computer Graphics
- Technical Informatics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence
[University of Szeged]
Institute of Informatics>>> Departments>>> Department of Foundations of Computer Science>>> flag_HUMagyarul

Publications 2001-

Zoltán Ésik

  1. Residuated Park theories, J. Logic and Computation, to appear.
  2. Equational theories for automata, in: Handbook of Automata, to appear.
  3. The FC rank of a context-free grammar, Inf. Processing Letters, to appear (coauthor: A. Carayol).
  4. Free inductive K-semialgebras, J. Algebraic and Logic Programming, to appear (coauthor: W. Kuich).
  5. Automata and Formal Languages, spec. issue devoted to the 2011 AFL conference, Int. J. Foundations of Comp. Sci., Vol. 23, No. 6, 2012, (coeditor: P. Dömösi).
  6. Fixed Points in Computer Science 2012, EPTCS 77, 2012, (coeditor D. Miller).
  7. Ordinal automata and Cantor normal form, Int. J. Foundations of Comp. Sci., 23(2012), 87-98.
  8. On Müller context-free grammars, Theoretical Computer Science, 416(2012), 17-32, (coauthor: Sz. Iván).
  9. A context-free linear ordering with an undecidable first-order theory, Theoretical Computer Science, TCS 2012, Amsterdam, LNCS 7604, Springer, 2012, 104-118 (coauthor: A. Carayol).
  10. On context-free languages of scattered words, in: Proc. DLT 2012, Taipei, LNCS 7410, Springer, 2012, 142-153, (coauthor: S. Okawa).
  11. Algebraic synchronization trees and processes, in: Proc. ICALP 2012, Part II., LNCS 7392, Springer, 2012, 30-41, (coauthors: L. Aceto, A. Carayol, A. Ingólfsdóttir).
  12. Hausdorff Rank of Scattered Context-free Linear Orders, in: Proc. LATIN 2012, LNCS 7256, 291-302, 2012, (coauthor: Sz. Iván).
  13. Free iterative and iteration K-semialgebras, Algebra Universalis, 67(2012), 141-162, (coauthor: W. Kuich).
  14. The category of simulations for weighted tree automata, Int. J. Foundations of Comp. Sci., 22(2011), 1845-1859, (coauthor: A. Maletti).
  15. Dagger extension theorem, Math. Struc. in Comp. Sci., Math. Struc. in Comp. Sci., 21(2011), 1036-1066, (coauthor: T. Hajgató).
  16. Stephen. L. Bloom, 1940-2010, Fundamenta Informaticae, 109(2011), 369-381, (co-author: Klaus Sutner).
  17. Büchi context-free languages, Theoretical Computer Science, 412(2011), 805-821, (coauthor: Sz. Iván).
  18. An undecidable property of context-free linear orders, Information Processing Letters, 111(2011), 107-109.
  19. Algebraic Linear Orderings, Int. J. Foundations of Computer Science, 22(2011), 491-515, (coauthor: S.L. Bloom).
  20. Scattered context-free linear orderings, in: Proc. Developments in Language Theory, Milan, 2011, LNCS 6795, Springer-Verlag, 2011, 216-227.
  21. Multi-linear iterative K-semialgebras, in: Proc. 27th Int. Conference on Mathematical Foundations of Programming Semantics, Carnegie Mellon University, May 2011, ENTCS 276, 2011, 159-170.
  22. Residuated Park theories, in: Proc. TACL 2011, Marseille, 2011, 37-40.
  23. Axiomatizing rational series, in: Proc. 8th Panhellenic Logic Symposium, Ioannina, 2011, 30-34, (coauthor: W. Kuich).
  24. A unifying Kleene Theorem for weighted finite automata, in: Maurer Festschrift, LNCS 6570, 76-89, Springer, Heidelberg 2011, (coauthor: W. Kuich).
  25. Partial Conway and iteration semiring-semimodule pairs, in: Algebraic Foundations in Computer Science, Essays dedicated to Symeon Bozapalidis on the occasion of his retirement, LNCS 7020, Springer, 2011, 56-71.
  26. Kleene theorem in partial Conway theories with applications, in: Algebraic Foundations in Computer Science, Essays dedicated to Symeon Bozapalidis on the occasion of his retirement, LNCS 7020, Springer, 2011, 72-93, (co-author: T. Hajgató).
  27. Simulations of tree automata, in: Proc. 15th Int. Conf. Implementation and Application of Automata, CIAA 2010, Springer, LNCS 6482, 2011, 321-330, (coauthor: A. Maletti).
  28. Simulation vs. equivalence, in: Proc. Foundations of Computer Science, FCS 2010, Las Vegas, 2010, Nevada, CSREA Press, 119-122, (coauthor: A. Maletti).
  29. Linear languages of finite and infinite words, Automata, Formal Languages and Algebraic Systems, World Scientific, 2010, 33-46, (coauthors: M. Ito, W. Kuich) .
  30. Extended temporal logics on finite trees, Automata, Formal Languages, and Algebraic Systems, World Scientific, 2010, 47-62, (coauthor: Sz. Iván).
  31. Modern Automata Theory, available from http://www.dmg.tuwien.ac.at/kuich/, (coauthor: W. Kuich).
  32. Automata and Formal Languages, Special issue devoted to AFL 2008, Int. J. Foundations of Computer Science, Vol. 21, No. 5, October 2010, (co-editor: E. Csuhaj-Varjú).
  33. Fundamentals of Computation Theory, Special issue devoted to papers presented at FCT 07, Theoretical Computer Science, 411(2010), Issues 4-5, (coeditor: E. Csuhaj-Varjú).
  34. Algebraic characterization of logically defined tree languages, Int. J. Algebra and Computation, 20(2010), 195-239, (coauthor: P. Weil).
  35. Algebraic ordinals, Fundamenta Informaticae, 99(2010), 383-407, (coauthor: S.L. Bloom).
  36. A family of temporal logics on finite trees, Publ. Math., Debrecen, 77(2010), 277-297, (coauthor: Sz. Iván).
  37. A Mezei-Wright theorem for categorical algebras, Theoret. Comput. Sci., 411(2010), 341-359, (coauthor: S. L. Bloom).
  38. Axiomatizing the Equational Theory of Regular Tree Languages, J. Logic and Algebraic Programming, 79(2010), 189-213.
  39. Representing small ordinals by finite automata, in Proc. 12th Workshop Descriptional Complexity of Formal Systems, Saskatoon, Canada, 2010, EPTCS, vol. 31, 78-87, 2010.
  40. On Müller context-free grammars, in: Proc. Developments in Language Theory, London, ON, LNCS 6224, Springer, 2010, 173-184, (coauthor: Sz. Iván).
  41. Formal languages and automata VI: omega-algebraic systems and transducers, Westnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta. Wyp. 10. Ser. Fiziko- matematitscheskije nauki, 2010, 8-32, (coauthors: S. Aleshnikov, J. Boltnev, S. Ishanov, W. Kuich).
  42. Automata and Formal Languages, Special issue of Acta Cybernetica, Vol. 19, No. 2, 2009, 441-565, (co-editor: E. Csuhaj-Varjú).
  43. Automata, Formal Languages, and Related Topics, Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, University of Szeged, 2009, (coeditor with Z. Fülöp).
  44. Selected Papers of the Conference "Computer Science Logic 2006", Szeged, Hungary, 2006, Special issue of Logical Methods in Computer Science, 2009, (coeditor: R. Ramanujam).
  45. Fixed point theory, in: Handbook of Weighted Automata, Springer, 2009, 29-66.
  46. Finite automata, in: Handbook of Weighted Automata, Springer, 2009, 69-104, (coauthor: W. Kuich).
  47. Estimation of state complexity of combined operations, Theoret. Comput. Sci., 410(2009), 3272-3281, (coauthors: Y. Gao, G. Liu, S. Yu).
  48. Axiomatizing rational power series over natural numbers, Information and Computation, 207(2009), 793-811, (coauthor: S. L. Bloom).
  49. Scattered algebraic linear orderings, in: Proc. 6th Workshop on Fixed Points in Computer Science, Coimbra, 2009, (Ralph Matthes and Tarmo Uustalu, eds.), Institute of Cybernetics at Tallinn University of Technology, 2009, 25-29.
  50. Cycle-free finite automata in partial iterative semirings, in: Proc. Conf. Algebraic Informatics 2009, Thessaloniki, LNCS 5725, Springer, 2009, 1-12, (coauthors: S.L. Bloom, W. Kuich).
  51. Iteration grove theories with applications, in: Proc. CAI 2009, Thessaloniki, LNCS 5725, Springer, 2009, 227-249, (coauthor: T. Hajgató).
  52. Context-free languages of countable words, in: Proc. ICTAC 2009, Kuala Lumpur, LNCS 5684, Springer, 2009, 185-199, (coauthor: Sz. Iván).
  53. Automata and Formal Languages, Procceedings of the 2008 conference, Balatonfüred, Computer and Automation Institute, Hungarian Academy of Science, 2008, (coeditor: E. Csuhaj-Varjú).
  54. Formaljnyje jasyki i avtomaty IV: Transduktory i abstraktnyje semejstva (Formal languages and automata IV: Transducers and abstract families). Westnik Rossijskogo Gosudarstvennogo Universiteta im. I.Kanta. Wyp.10. Ser. Fiziko-matematitscheskije nauki, 2008, 6-23, (coauthors: S. Aleshnikov, J. Boltnev, S. Ishanov, W. Kuich).
  55. Partial Conway and iteration semirings, Fundamenta Informaticae, 86(2008), 19-40, (coauthors: S.L. Bloom, W. Kuich).
  56. Some varieties of finite tree automata related to restricted temporal logics, Fundamenta Informaticae, 82(2008), 79-103, (coauthor: Sz. Iván).
  57. Products of tree automata with application to temporal logic, Fundamenta Informaticae, 82(2008), 61-78, (coauthor: Sz. Iván).
  58. Iteration semirings, in: Proc. DLT 2008, LNCS 5257, Springer, 2008, 1-21.
  59. Estimation of state complexity of combined operations, in: Proc. Descriptional Complexity of Formal Systems, DFCS 2008, University of Prince Edward Island, 168-181, (coauthors: Y. Gao, G. Liu, S. Yu).
  60. Games for Temporal Logics on Trees, in: Proc. CIAA 2008, LNCS 5148, Springer, 2008, 191-200, (coauthor: Sz. Iván).
  61. Fundamentals of Computation Theory 2007, Proceedings, LNCS 4639, Springer, 2007, (coeditor: E. Csuhaj-Varjú).
  62. A semiring-semimodule generalization of transducers and abstract omega-families of power series, J. Automata, Languages, and Combinatorics, 12(2007), 435-454, (coauthor: W. Kuich).
  63. On iteration semiring-semimodule pairs, Semigroup Forum, 75(2007), 129-159, (coauthor: W. Kuich).
  64. Fuzzy boolean sets, Int. J. Foundations of Computer Science, 18(2007), 1197-1207, (coauthor: W. Kuich).
  65. Fuzzy tree automata, Fuzzy Sets and Systems, 158(2007), 1450-1460, (coauthor: G. Liu).
  66. An algebraic characterization of Wolper's logic, Foundations of Computer Science, WORLDCOMP 2007, Las Vegas, CSRE Press, 2007, 139-143.
  67. Aperiodicity in tree automata, in: Proc. CAI 2007, LNCS 4728, Springer, 2007, 189-207, (coauthor: Sz. Iván).
  68. Regular and Algebraic Words and Ordinals, in: Proc. CALCO 2007, Bergen, LNCS 4624, Springer, 2007, 1-15, (coautor: S. L. Bloom).
  69. Fixed points in semiring theory, in: Proc. 1st International Workshop on Theory and Application of Language Equations (M. Kunc, A. Okhotin, eds.), Turku Center for Computer Science, 2007, 5-13, (coauthor: W. Kuich).
  70. The art of rationality. In honour of Professor Christian Choffrut on the occasion of his 60th birthday. Theoret. Comput. Sci., 356(2006), 262, (coeditors: A. Bertoni and J. Karhumäki)
  71. AFL 05, Special issue of Acta Cybernetica, Volume 17, No.4, 2006.
  72. Automata and Formal Languages, Special issue of Theoretical Computer Science, Volume 366, Number 3, 2006.
  73. Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25, Springer-Verlag, 2006, (coeditor with Victor Mitrana and Carlos Martín Vide).
  74. Computer Science Logic 2006, Proceedings, LNCS 4207, Springer-Verlag, 2006.
  75. Characterizing CTL-like Logics on Finite Trees, Theoretical Computer Science, 356(2006), 136-152.
  76. Cascade Products and Temporal Logics on Finite Trees, Electronic Notes in Theoretical Computer Science, Volume 162, 29 September 2006, Pages 163-166.
  77. Completing categorical algebras, in: Proc. Fourth IFIP Conf. Theoretical Computer Science, TCS 2006, Springer, 231-250, (coauthor: S. L. Bloom).
  78. Formalnyje jasyki i avtomaty III. Magazinnyje avtomaty i formalnyje stepennyje rjady. (Formal languages and automata III: Pushdown automata and algebraic power series.) Vestnik Rossiyskogo gosudarstvennogo universiteta im. Immanuila Kanta Vyp. 10:Ser. Fisiko-matematicheskije nauki, 2006, 8-27, (coauthors: S. Aleshnikov, J. Boltnev, S. Ishanov, W. Kuich).
  79. Automata and Formal Languages 2005, Proceedings of the 11th International Conference, Dobogókő, May 17-20, 2005 (coeditor with Z. Fülöp).
  80. Process Algebra, Special issue of Theoretical Computer Science, Vol. 335:2-3(2005) (coeditors: L. Aceto, W. Fokkink and A. Ingólfsdóttir).
  81. A semiring-semimodule generalization of $\omega$-regular languages, Part 1, J. Automata, languages, and Combinatorics, 10(2005), 203-242, (coauthor: W. Kuich).
  82. A semiring-semimodule generalization of $\omega$-regular languages, Part 2, J. Automata, languages, and Combinatorics, 10(2005), 243-264, (coauthor: W. Kuich).
  83. Algebraically complete semirings and Greibach normal form, Annals of Pure and Applied Logic, 103(2005), 173-203 (coauthor: Hans Leiss).
  84. The equational theory of regular words, Information and Computation, 197(2005), 55-89, (coauthor: S. L. Bloom).
  85. Algebraic recognizability of regular tree languages, Theoretical Computer Science, 340(2005), 291-321, (coauthor: P. Weil).
  86. Algebraic and graph-theoretic properties of infinite $n$-posets, Theoretical Informatics and Applications, 39(2005), 305-322, (coauthor: Z. L. Németh).
  87. An algebraic characterization of the expressive power of temporal logics on finite trees, Part 1, in: Proc. 1st International Conference on Algebraic Informatics, Aristotle University of Thessaloniki, 2005, 53--78.
  88. An algebraic characterization of the expressive power of temporal logics on finite trees, Part 2, in: Proc. 1st International Conference on Algebraic Informatics, Aristotle University of Thessaloniki, 2005, 79--100.
  89. An algebraic characterization of the expressive power of temporal logics on finite trees, Part 3, in: Proc. 1st International Conference on Algebraic Informatics, Aristotle University of Thessaloniki, 2005, 101--110.
  90. A note on Wolper's logic, in: Proc. Workshop on Semigroups and Automata, Lisboa, 2005, electronic (coauthor: G. Martin).
  91. Formal languages and automata, Part II: Continuous semirings and algebraic systems (in Russian), Vectnik, Kaliningradckogo gocudarctvennogo universiteta, Seria Informatika i telekommunikacia, to appear, (coauthors: S. Aleshnikov, J. Boltnev, S. Ishanov, W. Kuich, N. Malachovskij).
  92. Developments in Language Theory, DLT'03, Special issue of Theoretical Computer Science, 327:3(2004) (coeditor with Z. Fülöp).
  93. Fixed Points in Computer Science 03, Warsaw, Special issue of Theoretical Informatics and Applications, 38:4(2004) (coeditor with I. Walukiewicz).
  94. Inductive $^*$-semirings, Theoret. Comput. Sci, 324(2004), 3--33 (coauthor: W. Kuich).
  95. Axiomatizing omega and omega-op power on words, Theoretical Informatics and Applications, 38(2004), 3-18 (coauthor: S. L. Bloom).
  96. Higher dimensional automata, J. of Automata, Languages and Combinatorics, 9(2004), 3-29 (coauthor: Z. L. Németh).
  97. A semiring-semimodule generalization of $\omega$-context-free languages, Theory is Forever, LNCS 3113, Springer, 2004, 68-80 (coauthor: W. Kuich).
  98. Equational Axioms for a Theory of Automata, Formal Languages and Applications, Studies in Fuzziness and Soft Computing 148, Carlos Martin-Vide, Victor Mitrana, Gheorghe Paun (Eds.), Springer, 2004, 183-196 (coauthor: W. Kuich).
  99. An algebraic generalization of omega-regular languages, in: Proc. MFCS 04, Prague, LNCS 3153, Springer, 2004, 648-659 (coauthor: W. Kuich).
  100. Fixed Points in Computer Science 02, Copenhagen, Special issue of Theoretical Informatics and Applications, 37(2003), 271-391 (coeditor with A. Ingolfsdottir).
  101. Formal languages and automata I: Conway semirings and finite automata (in Russian), Vectnik, Kaliningradckogo gocudarctvennogo universiteta, Seria Informatika i telekommunikacia, 3(2003), 7-38 (coauthors: S.I. Aleshnikov, Ju. F. Boltnev, Z. Ésik, S.A. Ishanov, W. Kuich).
  102. Axioms for regular words, in: Proc. FST&TCS 03, Mumbai, LNCS 2914, Springer, 2003, 50-61 (coauthor: S. L. Bloom).
  103. On logically defined recognizable tree languages, in: Proc. FST&TCS 03, Mumbai, LNCS 2914, Springer, 2003, 195-207 (coauthor: P. Weil).
  104. Regular languages defined by Lindstöm quantifiers, Theoretical Informatics and Applications, 37(2003), 179-242 (coauthor: K. G. Larsen).
  105. Process algebra: Open problems and future directions, PA'03, Bologna, Italy, 21-25 July 2003, BRICS Notes Series NS-03-3, 2003, (coeditor with: L. Aceto, W. J. Fokkink, A. Ingólfsdóttir).
  106. Developments in Language Theory, 7th International Conference, DLT 2003, LNCS 2710, Springer, 2003 (coeditor with Z. Fülöp).
  107. Deciding whether the frontier of a regular tree is scattered, Fundamenta Informaticae, 55(2003), 1-21 (coauthor: S. L. Bloom).
  108. An extension theorem with an application to formal tree series, J. of Automata, Languages and Combinatorics, 8(2003), 145-185 (coauthor: S.L. Bloom).
  109. Formal tree series, J. of Automata, Languages and Combinatorics, 8(2003), 219-285 (coauthor: W. Kuich).
  110. Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata, Acta Cybernetica, 16(2003), 1-28 (coauthor: M. Ito).
  111. Equational theories of tropical semirings, Theoretical Computer Science, 298(2003), 417-469 (coauthors: L. Aceto and A. Ingólfsdóttir).
  112. Hazard algebras, Formal Methods in System Design, 23(2003), 223-256 (coauthor: J. Brzozowski).
  113. Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators, in: Proc. DLT 02, Kyoto, LNCS 2450, 43-58, Springer, 2003.
  114. Free De Morgan bisemigroups and bisemilattices, Algebra Colloquium, 10(2003), 23-32.
  115. The max-sum algebra of natural numbers has no finite equational basis, Theoretical Computer Science, 293(2003), 169-188 (coauthors: L. Aceto and A. Ingólfsdóttir).
  116. Fixed Points in Computer Science 02, Copenhagen, Preliminary Proceedings, BRICS Notes Series, NS-02-2, 2002 (coeditor with A. Ingólfsdóttir).
  117. A fully equational proof of Parikh's theorem, Theoretical Informatics and Applications, 36(2002), 129-154 (coauthors: L. Aceto, A. Ingólfsdóttir).
  118. Locally closed semirings, Monatshefte Mathematik, 137(2002), 21-29 (coauthor: W. Kuich).
  119. Rationally additive semirings, J. Universal Computer Science, 2(8) 2002, 173-183 (coauthor: W. Kuich).
  120. Continuous additive algebras and injective simulations of synchronization trees, J. Logic. Comput., 12(2002), 271-300.
  121. A note on completeness of the $\nu_3$-product, Publ. Math., 60(2002), 539-550 (coauthor: P. Dömösi).
  122. Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Theoretical Computer Science, 273(2002), 225-248.
  123. Greibach normal form in algebraically complete semirings, in: Proc. Computer Science Logic, CSL 2002, Edingurgh, LNCS 2471, Springer, 2002, 135-150 (coauthor: H. Leiss).
  124. Unique guarded fixed-points in an additive setting, in: Proc. Category Theory and Computer Science, CTCS 2002, Ottawa, ENTCS, vol. 69, Elsevier, 2002, 16 pages, (coauthor: S. L. Bloom).
  125. Equational axioms for probabilistic bisimilarity, in: Proc. Algebraic Methodology and Software Technology, AMAST 2002, Reunion, LNCS 2422, Springer, 2002, 239-253 (coauthors: L. Aceto, A. Ingólfsdóttir).
  126. The equational theory of fixed points with applications to generalized language theory, in: Proc. Developments in Language Theory, 5th Int. Conf., LNCS 2295, Springer-Verlag, 2002, 21-36.
  127. Automata on series-parallel biposets, in: Proc. Developments in Language Theory, 5th Int. Conf., LNCS 2295, Springer, 2002, 217-227 (coauthor: Z. L. Németh).
  128. Iteration 2-theories, Applied Categorical Structures, 9(2001), 173-216 (coauthors: S. L. Bloom, A. Labella and E. Manes).
  129. Homomorphic Simulation and Letichevsky's Criterion, J. of Automata, Languages and Combinatorics, 6(2001), 427-436 (coauthor: P. Dömösi).
  130. A generalization of Kozen's axiomatization of the equational theory of the regular sets, in: Words, Semigroups, and Transductions, M. Ito, Gh. Paun, Sheng Yu, eds., World Scientific, 2001, 99-114 (coauthor: W. Kuich).
  131. On equations for union-free regular languages, Information and Computation, 164(2001), 152-172 (coauthors: S. Crvenkovic and I. Dolinka).
  132. Nonfinitely Based Tropical Semirings, in: Proc. WORKSHOP ON MAX-PLUS ALGEBRAS and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, 27-29 August, 2001, Prague, (S. Gaubert and J. J.Loiseau editors), IFAC (International Federation of Automatic Control) Publications, Elsevier Science, 2001, 29-34 (coauthors: L. Aceto and A. Ingólfsdóttir).
  133. Algebras for hazard detection, in: 31st IEEE International Symposium on Multiple-Valued Logic, 22-24 May 2001, Warsaw, Poland, IEEE Computer Society, Los Alamitos, California, 2001, 3-12. (coauthors: J. Brzozowski and Y. Iland).
  134. Axiomatizing tropical semirings, in: Proc. Foundations of Software Science and Computation Structures, Genova, 2001, (F. Honsell and M. Miculan editors), Lecture Notes in Computer Science 2030, Springer-Verlag, April 2001, 42-56 (coauthors: L. Aceto and A. Ingólfsdóttir).
  135. Hazard algebras, in: Half Century of Automata Theory, London, ON, 2000, World Scientific, Singapore, 2001, 1-19 (coauthor: J. A. Brzozowski).

Zoltán Fülöp

  1. Equational Weighted Tree Transformations, Acta Informatica, 49(2012), 29-52, (coauthors: S. Bozapalidis and G. Rahonis).
  2. A Büchi-like Theorem for Weighted Tree Automata over Multioperator Monoids, Theory of Computing Systems, 50(2012), 241-278, (coauthors: T. Stüber and H. Vogler).
  3. Weighted Extended Tree Transducers, Fundamenta Informaticae, 111(2011), 163-202, (coauthors: Maletti and H. Vogler).
  4. Equational Weighted Tree Transformations with Discounting, In: Algebraic Foundations in Computer Science (Eds. W. Kuich and G. Rahonis), LNCS 7020, Springer-Verlag, 2011, 112-145, (coauthor: G. Rahonis).
  5. Equational Tree Transformations, Theoret. Comput. Science, 412(2011), 3676-3692, (coauthors: S. Bozapalidis and G. Rahonis).
  6. Varieties of Recognizable Tree Series over Fields, Theoret. Comput. Science, 412(2011), 736-752, (coauthor: M. Steinby).
  7. Preservation of Recognizability for Synchronous Tree Substitution Grammars, in: Proc. 2010 Workshop on Applications of Tree Automata in Natural Language Processing (F. Drewes and M. Kuhlmann eds.), The Association for Computational Linguistics, 2010, 1-9, (coauthors: A. Maletti and H. Vogler).
  8. Weighted Tree Walking Automata, Acta Cybernetica, 19(2009), 257-293, (coauthor: L. Muzamel).
  9. Weighted Tree Automata and Tree Transducers, In: Handbook of Weighted Automata (M. Droste, W. Kuich, and H. Vogler eds.), Chap. 9, Springer, Berlin, 2009, (coauthor H. Vogler).
  10. Automata, Formal Languages, and Related Topics, Novadat, 2009, 55-78, (coeditor: Z. Ésik).
  11. Formal Series of General Algebras over a Field and Their Syntactic Algebras, In: Automata, Formal Languages, and Related Topics (Z. Ésik and Z. Fülöp eds.), Novadat, 2009, 55-78, (coauthor: M. Steinby).
  12. Decomposition of Weighted Multioperator Tree Automata, Int. J. Found. Comput. Sci., 20(2009), 221-245, (coauthors: T. Stüber and H. Vogler).
  13. A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids, Theory of Computing Systems, 44(2009), 455-499, (coauthors: A. Maletti and H. Vogler).
  14. Pebble Macro Tree Transducers with Strong Pebble Handling, Fundamenta Informaticae, 89(2008), 207-257, (coauthor: L. Muzamel).
  15. Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers, Journal of Automata, Langauges and Combinatorics, 13(2008), 3-44, (coauthor L. Muzamel).
  16. Magyar nyelvi korpuszok tömör reprezentációja, Alkalmazott Nyelvtudomány, 1-2(2005), 61-70, (társszerzők: A. Kertész-Farkas és A. Kocsor).
  17. Linear Deterministic Multi Bottom-up Tree Transducers, Theoret. Comput. Science, 347(2005), 275-287, (coauthors: A. Küehnemann and H. Vogler).
  18. Proceedings of the 4th Conference for PhD Students (CSCS 04), Special issue of Acta Cybernetica Vol. 17, No. 2, 2005.
  19. Proceedings of AFL 05, the 11th International Conference on Automata and Formal Languages, Novadat, 2005, (coeditor: Z. Ésik)
  20. An Introduction to Tree Transducers, Formal Methods in Computing (Eds. M. Ferenczi, A. Pataricza and L. Rónyai), Akadémiai Kiadó, Budapest, 2005, 199-258.
  21. Recent Results on Pebble Macro Tree Transducers, In. Proc: 1st International Conference on Algebraic Informatics, October 20-23 2005, Thessaloniki, 281-284, (coauthor: L. Muzamel).
  22. Formális nyelvek és szintaktikus elemzésük, Polygon, Szeged, 2nd edition, 2004.
  23. Bounds for Tree Automata with Polynomial Costs, Journal of Automata, Langauges and Combinatorics, 9(2004), 31-54, (coauthors: B. Borchardt, Zs. Gazdag and A. Maletti).
  24. Developments in Language Theory, DLT 03, Special issue of Theoretical Computer Science, Vol. 327, No. 3, 2004, (coeditor: Z. Ésik)
  25. Weighted Tree Transducers, Journal of Automata, Langauges and Combinatorics, 9(2004), 31-54, (coauthor: H. Vogler).
  26. A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Inf. Process. Letters, Inf. Process. Letters, 91(2004), 57-67, (coauthors: A. Küehnemann and H. Vogler).
  27. Hiererchies of Tree Series Transformations, Theoret. Comput. Science, 314(2004), 387-429, (coauthors: Zs. Gazdag and H. Vogler).
  28. Developments in Language Theory, 7th International Conference, DLT 2003, LNCS 2710, Springer, 2003 (coeditor with Z. Ésik).
  29. Magyar nyelvű szótárak tömör reprezentációja nemdeterminisztikus automatákkal, Magyar Számítógépes Nyelvészeti Konferencia kiadványa, 231-236, SZTE, Informatikai Tanszékcsoport, 2003 (társszerzők: Kertész-Farkas A. és Kocsor A).
  30. Fatranszformátorok számítási erejének összehasonlítása, MTA doktori értekezés, MTA, 2003.
  31. Tree Series Transformations that Respect Copying, Theory of Computing Systems, 36(2003), 247-293 (coauthor: H. Vogler).
  32. Shape Preserving Top-Down Tree Transducers, Theoret. Comput. Science, 304(2003), 315-339 (coautor: Zs. Gazdag).
  33. Bottom-up and Top-down Tree Series Transformations, Journal of Automata, Languages and Combinatorics, 7(2002), 11-70 (coauthors: J. Engelfriet and H. Vogler).
  34. Iterated Relabeling Tree Transducers, Theoret. Comput. Science, 276(2002), 221-244 (coauthor: A. Terlutte).
  35. Branching-Pattern Analysis of the Dendritic Arborization in the Thalamic Nuclei of the Rat Brain, Acta Biologica Hungarica, 53(2002), 177-186 (coauthors: Cs. Szigeti and K. Gulya).
  36. Tree Transducers with Costs, in: Proc. 10th International Conference on Automata and Formal Languages (August 13 - 18, 2002, Debreceni Egyetem, Hungary) (coauthors: H. Vogler).
  37. Generalizations of Tree Transducers to Tree Series Transducers (abstract), in: Proc. International Workshop "Weighted Automata: Theory and Applications" , Dresden University of Technology, 2002.
  38. The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammar Systems, Theoret. Comput. Science, 262(2001), 229-240 (coauthor: G. Dányi).
  39. Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers, Journal of Automata, Languages and Combinatorics 6(2001), 145-189.
  40. Restricted Ground Tree Transducers, Theoret. Comput. Science, 250(2001), 219-233 (coauthor: S. Vágvölgyi).

Szabolcs Iván

  1. On Müller context-free grammars, Theoretical Computer Science, 416(2012), 17-32, (coauthor: Z. Ésik).
  2. Hausdorff Rank of Scattered Context-free Linear Orders, in: Proc. LATIN 2012, LNCS 7256, 291-302, 2012, (coauthor: Z. Ésik).
  3. Proceedings of Automata and Formal Languages, AFL 2011, Debrecen, Magyarország, 2011.08.17-2011.08.22, Debrecen-Nyíregyháza, 2011, (coeditor: P. Dömösi).
  4. Müller context-free grammars generating well-ordered words, In: Proceedings of Automata and Formal Languages, AFL 2011, 2011, 225-240.
  5. Büchi context-free languages, Theoretical Computer Science, 412(2011), 805-821, (coauthor: Z. Ésik).
  6. Extended temporal logics on finite trees, Automata, Formal Languages, and Algebraic Systems, World Scientific, 2010, 47-62, (coauthor: Z. Ésik).
  7. On Müller context-free grammars, in: Proc. Developments in Language Theory, London, ON, LNCS 6224, Springer, 2010, 173-184, (coauthor: Z. Ésik).
  8. A family of temporal logics on finite trees, Publ. Math., Debrecen, 77(2010), 277-297, (coauthor: Z. Ésik).
  9. Context-free languages of countable words, in: Proc. ICTAC 2009, LNCS 5684, Springer, 2009, (coauthor: Z. Ésik).
  10. Improved upper bounds on synchronizing nondeterministic automata, Information Processing Letters, 109(2009), 986-990, (coauthors: Zs. Gazdag, J. Nagy-György).
  11. Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics, Fundamenta Informaticae, 82(2008), 79-103, (coauthor: Z. Ésik).
  12. Products of Tree Automata with an Application to Temporal Logic, Fundamenta Informaticae, 82(2008), 61-78, (coauthor: Z. Ésik).
  13. Games for Temporal Logics on Trees, in: Proc.CIAA 2008, LNCS 5148, Springer, 2008, 191-200, (coauthor: Z. Ésik).
  14. Aperiodicity in Tree Automata, in: Proc. CAI 2007, LNCS 4728, Springer, 2007, 189-207, (coauthor: Z. Ésik).
  15. Az iteralt shuffle muvelet alkalmazasa regularis nyelveken, Alkalmazott Matematikai Lapok, 24(2007), 187-207.

Zoltán L. Németh

  1. A Kleene Theorem for Bisemigroup and Binoid Languages, International Journal of Foundations of Computer Science, 22(2011), 427-446, (coauthor: Zs. Gazdag).
  2. Model Checking of the Slotted CSMA/CA MAC Protocol of the IEEE 802.15.4 Standard, MATCOS-10, Proceedings of the 2010 Mini-Conference on Applied Theoretical Computer Science, A. Brodnik and G. Galambos (Eds.), University of Primorska Press, 2011, 121-126.
  3. A Kleene theorem for binoid languages, in: Proc. Automata and Formal Languages, AFL 2008, Computer and Automation Institute, Hungarian Academy of Science, 2008, 170-182, (coauthor: Zs. Gazdag).
  4. On the regularity of binoid languages: a comparative approach. In: Preproc. 1st Int. Conf. on Language and Automata Theory and Appl., LATA'07, March 29 - April 4, 2007, Tarragona, Spain.
  5. Automata on infinite biposets, Acta Cybernetica, 17(2006), 765-797.
  6. Algebraic and graph-theoretic properties of infinite n-posets, RAIRO, Theoretical Informatics and Applications, 39(2005), 305-322 (coauthor: Z. Ésik).
  7. Automata on infinite biposets, in: Automata and Formal Languages, 11th Int. Conf., AFL 2005, Dobogókő, Hungary, May 17-20, Proceedings, Institute of Informatics, University of Szeged, Szeged, 2005, 213-226.
  8. A hierarchy theorem for regular languages over free bisemigroups, Acta Cybernetica, 16(2004), 567--577.
  9. Higher dimensional automata, J. of Automata, Languages and Combinatorics, 9(2004), 3-29 (coauthor: Z. Ésik).
  10. Automata on series-parallel biposets, in: Proc. DLT 2001, 5th Int. Conf., LNCS 2295, Springer, 2002, 217-227 (coauthor: Z. Ésik).

Sándor Vágvölgyi

  1. Ground Term Rewriting, Bulletin of the EATCS, to appear.
  2. Rewriting preserving recognizability of finite tree languages, The Journal of Logic and Algebraic Programming 82 (2013), 71-94.
  3. CHAP and rewrite components, Acta Informatica, 48(2011), 317-361.
  4. Tree Homomorphisms for Unranked Trees, In: Proc. Automata and Formal Languages, AFL 2011, 2011, 225-240, (coauthors: X. Piao, K. Salomaa).
  5. Congruences generated by extended ground term rewrite systems, Fundamenta Informaticae 95(2009), 381-399.
  6. On Ranges of Bottom-up Tree Transducers, In: Automata, Formal Languages, and Related Topics (Z. Ésik and Z. Fülöp eds.), Novadat, 2009, 129-143.
  7. Deterministic bottom-up tree transducers and ground term rewrite systems, Theoret. Comp. Sci., 410(2009), 2250-2278.
  8. Murg term rewrite systems, Information Processing Letters, 108(2008), 264-272.
  9. Losing recognizability, Theor. Comput. Sci., 379(2007), 298-304.
  10. Descendants of a recognizable tree language for sets of linear monadic term rewrite rules, Information Processing Letters, 99(2006), 111-118.
  11. Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems, Bulletin of the EATCS, 82(2004), 269-285.
  12. Storage-to-tree transducers with look-ahead, Theoretical Computer Science, 329(2004), 115-158, (coauthor: T. Hornung).
  13. On ground tree transformations and congruences induced by tree automata, Theoretical Computer Science, 304(2003), 449-459.
  14. Term rewriting restricted to ground terms, Theoretical Computer Science, 302(2003), 135-165.
  15. Intersection of finitely generated congruences over term algebra, Theoretical Computer Science, 300(2003), 209-234.
  16. Shuffle Decompositions of Regular Languages, International Journal of Foundations of Computer Science, 13(2002), 799-816 (coauthors: C. Campeanu and K. Salomaa).
  17. Restricted ground tree transducers, Theoretical Computer Science, 250(2001), 219-233 (coauthor: Z. Fülöp).
  18. The Ground Tree Transducer Game with Identical Tree Automata, Fundamenta Informaticae, 45(2001) 157-172 (coauthor: J. Apró).
Webmaster:webmaster@inf.u-szeged.hu