Jelenlegi hely

Publikációk 2001-

MEGJELENÉS ALATT

  1. Z. Ésik: Equational theories for automata, in: Handbook of Automata, EMS Publishing House, to appear.
  2. J. Engelfriet, Z. Fülöp, A. Maletti: Composition Closure of Linear Extended Top-down Tree Transducers, Theory of Computing Systems, to appear.

2016

  1. A. Carayol, Z. Ésik: An Analysis of the Equational Properties of the Well-Founded Fixed Point, in Proc: Principles of Knowledge Representation and Reasoning (KR 2016), AAAI Press, 2016, 533-536.
  2. Z. Ésik, Sz. Iván: MSO-definable Properties of Muller Context-Free Languages Are Decidable, in Proc: Descriptional Complexity of Formal Systems, DFCS 2016, LNCS 9777, Springer, 2016, 87-97.
  3. M. Droste M, Z. Fülöp, D. Götze: A Kleene theorem for weighted tree automata over tree valuation monoids, in Proc: LATA 2016, LNCS 9618, Springer, 2016, 452-463.
  4. Z. Fülöp, A. Maletti: Linking theorems for tree transducers, J. Comp. Syst. Sci., 82(2016), 1201-1222.
  5. Sz. Iván: Complexity of Atoms, Combinatorially, Information Processing Letters, 116(2016), 356-360.
  6. Sz. Iván, J. Nagy-György: On nonpermutational transformation semigroups with an application to syntactic complexity, Acta Cybernetica, 22(2016), 687-701.
  7. S. Vágvölgyi: On one-pass reductions, Acta Cybernetica, 22(2016), 633-655.
  8. S. Vágvölgyi: Number of equivalent reduced ground term rewriting systems, Asian Journal of Mathematics and Computer Research, 8 (2016), 56-68.

2015

  1. Z. Ésik: Residuated Park theories, J. Logic and Computation, 25(2015), 453-471.
  2. Z. Ésik, P. Rondogiannis: A fixed point theorem for non-monotonic functions, Theoret. Comp. Science, 574(2015), 18-38.
  3. Z. Ésik, U. Fahrenberg, A. Legay: *-Continuous Kleene omega-algebras, in Proc: DLT 2015, LNCS 9168, Springer, 2015, 240-251.
  4. Z. Ésik: Equational Properties of Fixed Point Operations in Cartesian Categories, in Proc: MFCS 2015, LNCS 9234, Springer, 2015, 18-37.
  5. Z. Ésik: Equational Properties of Stratified Least Fixed Points, in Proc: WoLLIC 2015, LNCS 9160, Springer, 2015, 174-188.
  6. Z. Ésik, U. Fahrenberg, A. Legay: *-Continuous Kleene ω-Algebras for Energy Problems, in Proc: FICS 2015, EPTCS 191.
  7. Z. Fülöp: Local Weighted Tree Languages, Acta Cybern., 22(2015), 393-402.
  8. Z. Fülöp, H. Vogler: Characterizations of Recognizable Weighted Tree Languages by Logic and Bimorphisms, Soft Computing, 2015, DOI: 10.1007/s00500-015-1717-2.
  9. Z. Fülöp, H. Vogler: Characterizing weighted MSO for trees by branching transitive closure logics, Theoret. Comp. Science, 594(2015), 82-105.
  10. N. Hantos, Sz. Iván, P. Balázs, K. Palágyi: Binary image reconstruction from a small number of projections and the morphological skeleton, Annals of Mathematics and Artificial Intelligence, 75(2015), 195-216.
  11. Z. L. Németh, L. Erdődi: When Every Byte Counts – Writing Minimal Length Shellcodes, in: Proc. SISY 2015, IEEE, 2015, 269-274.
  12. Z. L. Németh: Modern Binary Attacks and Defences in the Windows Environment – Fighting Against Microsoft EMET in Seven Rounds, in: Proc. SISY 2015, IEEE, 2015, 275-280.
  13. S. Vágvölgyi: On ground word problem of term equation systems, Acta Cybernetica, 22 (2015), 517-551.
  14. S. Vágvölgyi: Symbol Different Term Rewrite Systems, Journal of Logical and Algebraic Methods in Programming, 84 (2015), 551-575.

2014

  1. E. Csuhaj-Varjú, M. Diaetzfelbinger, Z. Ésik (Eds): Mathematical Foundations of Computer Science, Vol. I., LNCS 8634, Springer-Verlag, 2014.
  2. E. Csuhaj-Varjú, M. Diaetzfelbinger, Z. Ésik (Eds): Mathematical Foundations of Computer Science, Vol. II., LNCS 8635, Springer-Verlag, 2014.
  3. Z. Ésik, Z. Fülöp (Eds.): Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, EPTCS 151.
  4. Z. Ésik, Sz. Iván: Operational Characterization of Scattered MCFLs, Int. J. Found. Comput. Sci, 25(2014), 1001-1016.
  5. A. Charalambidis, Z. Ésik, P. Rondogiannis: Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation, Theory and Practice of Logic Programming, 14(2014), 725–737.
  6. M. Droste, Z. Ésik, W. Kuich: Conway and iteration hemirings Part 1, International Journal of Algebra and Computation, 24(2014a), 461–482.
  7. M. Droste, Z. Ésik, W. Kuich: Conway and iteration hemirings Part 2, International Journal of Algebra and Computation, 24(2014b), 483–513.
  8. Z. Ésik: Axiomatizing synchronization trees and weighted bisimilarity, Theoretical Computer Science, 534(2014), 2–23.
  9. Z. Ésik, T. Hajgató: On the structure of free iteration semirings, Journal of Automata Languages and Combinatorics, 19(2014), 57–66.
  10. Z. Ésik, W. Kuich: On power series over a graded monoid, in: Computing with New Resources, SpringerVerlag, 2014, 49-55.
  11. Z. Ésik, P. Rondogiannis: Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars, In: Logic, Language, Information and Computation, Springer Verlag, 2014, 166–180.
  12. Z. Fülöp, H. Vogler: Forward and backward application of symbolic tree transducers, Acta Informatica, 51(2014), 297-325.
  13. Sz. Iván: Synchronizing weighted automata, in: Proc. AFL 2014, EPTCS 151, 2014, 301-313.
  14. Sz. Iván, Á. D. Lelkes, J. Nagy-György, B. Szörényi, Gy. Turán: Biclique coverings, rectifier networks and the cost of epsilon-removal, in: Proc. DCFS 2014, LNCS 8614, 174-185, 2014.
  15. S. Vágvölgyi: Tree shuffle, Theoretical Computer Science 521(2014), 8-28.

2013

  1. Z. Ésik, S. Okawa: Context free languages of scattered words, International Journal of Foundations of Computer Science, 24(2013), 1029–1047.
  2. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: COBPEMENNAJA THEORIJA ABTOMATOB, Kalinyingrád PG - 261: Immanuel Kant State University of Russia, 2013.
  3. Z. Ésik: A Connection Between Concurrency and Language Theory, Electronic Notes in Theoretical Computer Science 298(2013), 143-164.
  4. Z. Ésik: A Connection Between Concurrency and Language Theory, Electronic Notes in Theoretical Computer Science 298(2013), 143-164.
  5. A. Carayol, Z. Ésik: The FC-rank of a context-free grammar, Inf. Processing Letters, 113(2013), 285-287.
  6. Z. Ésik, W. Kuich: Free inductive K-semialgebras, J. Algebraic and Logic Programming, 82(2013), 111-122.
  7. Z. Ésik, U. Fahrenberg, A. Legay, K. Quaas: Kleene Algebras and Semimodules for Energy Problems, in: Proc. Automated Technology for Verification and Analysis, Berlin, Springer-Verlag, 2013, 102-117.
  8. Z. Ésik, P. Rondogiannis: A fixed-point theorem for non-monotonic functions, in: Proc. 9th Panhellenic Logic Symposium, Athen, 2013, 43-48.
  9. Z. Ésik, Sz. Iván: Operational characterization of scattered MCFLs. in: Proc. DLT 2013, Heidelberg, Springer Verlag, 2013, 215-226.
  10. Z. Fülöp, A. Maletti: Composition Closure of epsilon-free Linear Extended Top-down Tree Transducers, In: Proc. DLT 2013, Springer-Verlag, Berlin, 2013, 239-251.
  11. S. Vágvölgyi: Recognizing relations by tree automata, Journal of Automata, Languages, and Combinatorics, 18(2013), 113-125.
  12. S. Vágvölgyi: Rewriting preserving recognizability of finite tree languages, The Journal of Logic and Algebraic Programming 82(2013), 71-94.

2012

  1. Z. Ésik, P. Dömösi (Eds.): Automata and Formal Languages, spec. issue devoted to the 2011 AFL conference, Int. J. Foundations of Comp. Sci., Vol. 23, No. 6, 2012.
  2. D. Miller, Z. Ésik (Eds.): Fixed Points in Computer Science 2012, EPTCS 77, 2012.
  3. Z. Ésik: Ordinal automata and Cantor normal form, Int. J. Foundations of Comp. Sci., 23(2012), 87-98.
  4. Z. Ésik, Sz. Iván: On Müller context-free grammars, Theoretical Computer Science, 416(2012), 17-32.
  5. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata VIII: Formal tree series, Part 2, (in Russian), Vestnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta, 2012, No. 10, 7-49.
  6. A. Carayol, Z. Ésik: A context-free linear ordering with an undecidable first-order theory, Theoretical Computer Science, TCS 2012, Amsterdam, LNCS 7604, Springer, 2012, 104-118.
  7. Z. Ésik, S. Okawa: On context-free languages of scattered words, in: Proc. DLT 2012, Taipei, LNCS 7410, Springer, 2012, 142-153.
  8. L. Aceto, A. Carayol, Z. Ésik, A. Ingólfsdóttir: Algebraic synchronization trees and processes, in: Proc. ICALP 2012, Part II., LNCS 7392, Springer, 2012, 30-41.
  9. Z. Ésik, Sz. Iván: Hausdorff Rank of Scattered Context-free Linear Orders, in: Proc. LATIN 2012, LNCS 7256, 291-302, 2012.
  10. Z. Ésik, W. Kuich: Free iterative and iteration K-semialgebras, Algebra Universalis, 67(2012), 141-162.
  11. Z. Fülöp, T. Stüber, H. Vogler: A Büchi-like Theorem for Weighted Tree Automata over Multioperator Monoids, Theory of Computing Systems, 50(2012), 241-278.
  12. S. Bozapalidis, Z. Fülöp, G. Rahonis: Equational Weighted Tree Transformations, Acta Informatica, 49(2012), 29-52.

2011

  1. Z. Ésik, A. Maletti: The category of simulations for weighted tree automata, Int. J. Foundations of Comp. Sci., 22(2011), 1845-1859.
  2. Z. Ésik, T. Hajgató: Dagger extension theorem, Math. Struc. in Comp. Sci., Math. Struc. in Comp. Sci., 21(2011), 1036-1066.
  3. Z. Ésik, K. Sutner: Stephen. L. Bloom, 1940-2010, Fundamenta Informaticae, 109(2011), 369-381.
  4. Z. Ésik, Sz. Iván: Büchi context-free languages, Theoretical Computer Science, 412(2011), 805-821.
  5. Z. Ésik: An undecidable property of context-free linear orders, Information Processing Letters, 111(2011), 107-109.
  6. S. L. Bloom, Z. Ésik: Algebraic Linear Orderings, Int. J. Foundations of Computer Science, 22(2011), 491-515.
  7. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata VII: Formal tree series, Part 1, (in Russian), Vestnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta, 2011, No. 10, 5-32.
  8. Z. Ésik: Scattered context-free linear orderings, in: Proc. Developments in Language Theory, Milan, 2011, LNCS 6795, Springer-Verlag, 2011, 216-227.
  9. Z. Ésik: 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.
  10. Z. Ésik: Residuated Park theories, in: Proc. TACL 2011, Marseille, 2011, 37-40.
  11. Z. Ésik, W. Kuich: Axiomatizing rational series, in: Proc. 8th Panhellenic Logic Symposium, Ioannina, 2011, 30-34.
  12. Z. Ésik, W. Kuich: A unifying Kleene Theorem for weighted finite automata, in: Maurer Festschrift, LNCS 6570, 76-89, Springer, Heidelberg 2011.
  13. Z. Ésik: 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.
  14. Z. Ésik, T. Hajgató: 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.
  15. Z. Ésik, A. Maletti: Simulations of tree automata, in: Proc. 15th Int. Conf. Implementation and Application of Automata, CIAA 2010, Springer, LNCS 6482, 2011, 321-330.
  16. Z. Fülöp, A. Maletti, H. Vogler: Weighted Extended Tree Transducers, Fundamenta Informaticae, 111(2011), 163-202.
  17. Z. Fülöp, G. Rahonis: Equational Weighted Tree Transformations with Discounting, In: Algebraic Foundations in Computer Science (W. Kuich and G. Rahonis Eds.), LNCS 7020, Springer-Verlag, 2011, 112-145.
  18. S. Bozapalidis, Z. Fülöp, G. Rahonis: Equational Tree Transformations, Theoret. Comput. Science, 412(2011), 3676-3692.
  19. Z. Fülöp, M. Steinby: Varieties of Recognizable Tree Series over Fields, Theoret. Comput. Science, 412(2011), 736-752.
  20. P. Dömösi, Sz. Iván (Eds.): Proceedings of Automata and Formal Languages, AFL 2011, Debrecen, Magyarország, 2011.08.17-2011.08.22, Debrecen-Nyíregyháza, 2011.
  21. Sz. Iván, Á. Mészáros: Müller context-free grammars generating well-ordered words, In: Proceedings of Automata and Formal Languages, AFL 2011, 2011, 225-240.
  22. Zs. Gazdag, Z. L. Németh: A Kleene Theorem for Bisemigroup and Binoid Languages, International Journal of Foundations of Computer Science, 22(2011), 427-446.
  23. Z. L. Németh: 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.
  24. X. Piao, K. Salomaa, S. Vágvölgyi: Tree Homomorphisms for Unranked Trees, In: Proc. Automata and Formal Languages, AFL 2011, 2011, 225-240.
  25. S. Vágvölgyi: CHAP and rewrite components, Acta Informatica, 48(2011), 317-361.

2010

  1. Z. Ésik, A. Maletti: Simulation vs. equivalence, in: Proc. Foundations of Computer Science, FCS 2010, Las Vegas, 2010, Nevada, CSREA Press, 119-122.
  2. Z. Ésik, W. Kuich, M. Ito: Linear languages of finite and infinite words, Automata, Formal Languages and Algebraic Systems, World Scientific, 2010, 33-46.
  3. Z. Ésik, Sz. Iván: Extended temporal logics on finite trees, Automata, Formal Languages, and Algebraic Systems, World Scientific, 2010, 47-62.
  4. Z. Ésik, W. Kuich: Modern Automata Theory, available from http://www.dmg.tuwien.ac.at/kuich/.
  5. E. Csuhaj-Varjú, Z. Ésik (Eds.): Automata and Formal Languages, Special issue devoted to AFL 2008, Int. J. Foundations of Computer Science, Vol. 21, No. 5, October 2010.
  6. E. Csuhaj-Varjú, Z. Ésik (Eds.): Fundamentals of Computation Theory, Special issue devoted to papers presented at FCT 07, Theoretical Computer Science, 411(2010), Issues 4-5.
  7. Z. Ésik, P. Weil: Algebraic characterization of logically defined tree languages, Int. J. Algebra and Computation, 20(2010), 195-239.
  8. S. L. Bloom, Z. Ésik: Algebraic ordinals, Fundamenta Informaticae, 99(2010), 383-407.
  9. Z. Ésik, Sz. Iván: A family of temporal logics on finite trees, Publ. Math., Debrecen, 77(2010), 277-297.
  10. S. L. Bloom, Z. Ésik: A Mezei-Wright theorem for categorical algebras, Theoret. Comput. Sci., 411(2010), 341-359.
  11. Z. Ésik: Axiomatizing the Equational Theory of Regular Tree Languages, J. Logic and Algebraic Programming, 79(2010), 189-213.
  12. Z. Ésik: Representing small ordinals by finite automata, in Proc. 12th Workshop Descriptional Complexity of Formal Systems, Saskatoon, Canada, 2010, EPTCS, vol. 31, 78-87, 2010.
  13. Z. Ésik, Sz. Iván: On Müller context-free grammars, in: Proc. Developments in Language Theory, London, ON, LNCS 6224, Springer, 2010, 173-184.
  14. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata VI: omega-algebraic systems and transducers, (in Russian), Vestnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta, 2010, No. 10, 8-32.
  15. Z. Fülöp, A. Maletti, H. Vogler: 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.
  16. Z. Fülöp, L. Muzamel: Weighted Tree Walking Automata, Acta Cybernetica, 19(2009), 257-293.
  17. S. Vágvölgyi: Ground Term Rewriting, Bulletin of the EATCS 102(2010), 153-190.

2009

  1. E. Csuhaj-Varjú, Z. Ésik (Eds.): Automata and Formal Languages, Special issue of Acta Cybernetica, Vol. 19, No. 2, 2009, 441-565.
  2. Z. Ésik, Z. Fülöp (Eds.): Automata, Formal Languages, and Related Topics, Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, University of Szeged, 2009.
  3. Z. Ésik, R. Ramanujam (Eds.): Selected Papers of the Conference "Computer Science Logic 2006", Szeged, Hungary, 2006, Special issue of Logical Methods in Computer Science, 2009.
  4. Z. Ésik: Fixed point theory, in: Handbook of Weighted Automata, Springer, 2009, 29-66.
  5. Z. Ésik, W. Kuich: Finite automata, in: Handbook of Weighted Automata, Springer, 2009, 69-104.
  6. Z. Ésik, Y. Gao, G. Liu, S. Yu: Estimation of state complexity of combined operations, Theoret. Comput. Sci., 410(2009), 3272-3281.
  7. S. L. Bloom, Z. Ésik: Axiomatizing rational power series over natural numbers, Information and Computation, 207(2009), 793-811.
  8. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata V: Conway semiring-semimodule pairs and finite automata, (in Russian), Vestnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta, 2009, No. 10, 6-41.
  9. Z. Ésik: 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.
  10. S. L. Bloom, Z. Ésik, W. Kuich: Cycle-free finite automata in partial iterative semirings, in: Proc. Conf. Algebraic Informatics 2009, Thessaloniki, LNCS 5725, Springer, 2009, 1-12.
  11. Z. Ésik, T. Hajgató: Iteration grove theories with applications, in: Proc. CAI 2009, Thessaloniki, LNCS 5725, Springer, 2009, 227-249.
  12. Z. Ésik, Sz. Iván: Context-free languages of countable words, in: Proc. ICTAC 2009, Kuala Lumpur, LNCS 5684, Springer, 2009, 185-199.
  13. Z. Fülöp, H. Vogler: Weighted Tree Automata and Tree Transducers, In: Handbook of Weighted Automata (M. Droste, W. Kuich, and H. Vogler Eds.), Chap. 9, Springer, Berlin, 2009.
  14. Z. Fülöp, M. Steinby: 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.
  15. T. Stüber, H. Vogler, Z. Fülöp: Decomposition of Weighted Multioperator Tree Automata, Int. J. Found. Comput. Sci., 20(2009), 221-245.
  16. Z. Fülöp, A. Maletti, H. Vogler: A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids, Theory of Computing Systems, 44(2009), 455-499.
  17. Zs. Gazdag, Sz. Iván, J. Nagy-György: Improved upper bounds on synchronizing nondeterministic automata, Information Processing Letters, 109(2009), 986-990.
  18. S. Vágvölgyi: Congruences generated by extended ground term rewrite systems, Fundamenta Informaticae 95(2009), 381-399.
  19. S. Vágvölgyi: 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.
  20. S. Vágvölgyi: Deterministic bottom-up tree transducers and ground term rewrite systems, Theoret. Comp. Sci., 410(2009), 2250-2278.

2008

  1. E. Csuhaj-Varjú, Z. Ésik (Eds.): Automata and Formal Languages, Procceedings of the 2008 conference, Balatonfüred, Computer and Automation Institute, Hungarian Academy of Science, 2008.
  2. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata IV: Transducers and abstract families, (in Russian), Westnik Rossijskogo Gosudarstvennogo Universiteta im. I. Kanta, 2008, No. 10, 6-23.
  3. S. L. Bloom, Z. Ésik, W. Kuich: Partial Conway and iteration semirings, Fundamenta Informaticae, 86(2008), 19-40.
  4. Z. Ésik, Sz. Iván: Some varieties of finite tree automata related to restricted temporal logics, Fundamenta Informaticae, 82(2008), 79-103.
  5. Z. Ésik, Sz. Iván: Products of tree automata with application to temporal logic, Fundamenta Informaticae, 82(2008), 61-78.
  6. Z. Ésik: Iteration semirings, in: Proc. DLT 2008, LNCS 5257, Springer, 2008, 1-21.
  7. Z. Ésik, Y. Gao, G. Liu, S. Yu: Estimation of state complexity of combined operations, in: Proc. Descriptional Complexity of Formal Systems, DFCS 2008, University of Prince Edward Island, 168-181.
  8. Z. Ésik, Sz. Iván: Games for Temporal Logics on Trees, in: Proc. CIAA 2008, LNCS 5148, Springer, 2008, 191-200.
  9. Z. Fülöp, L. Muzamel: Pebble Macro Tree Transducers with Strong Pebble Handling, Fundamenta Informaticae, 89(2008), 207-257.
  10. Z. Fülöp, L. Muzamel: Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers, Journal of Automata, Langauges and Combinatorics, 13(2008), 3-44.
  11. Zs. Gazdag, Z. L. Németh: 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.
  12. S. Vágvölgyi: Murg term rewrite systems, Information Processing Letters, 108(2008), 264-272.

2007

  1. E. Csuhaj-Varjú, Z. Ésik (Eds.): Fundamentals of Computation Theory 2007, Proceedings, LNCS 4639, Springer, 2007.
  2. Z. Ésik, W. Kuich: A semiring-semimodule generalization of transducers and abstract omega-families of power series, J. Automata, Languages, and Combinatorics, 12(2007), 435-454.
  3. Z. Ésik, W. Kuich: On iteration semiring-semimodule pairs, Semigroup Forum, 75(2007), 129-159.
  4. Z. Ésik, W. Kuich: Fuzzy boolean sets, Int. J. Foundations of Computer Science, 18(2007), 1197-1207.
  5. Z. Ésik, G. Liu: Fuzzy tree automata, Fuzzy Sets and Systems, 158(2007), 1450-1460.
  6. Z. Ésik: An algebraic characterization of Wolper's logic, Foundations of Computer Science, WORLDCOMP 2007, Las Vegas, CSRE Press, 2007, 139-143.
  7. Z. Ésik, Sz. Iván: Aperiodicity in tree automata, in: Proc. CAI 2007, LNCS 4728, Springer, 2007, 189-207.
  8. S. L. Bloom, Z. Ésik: Regular and Algebraic Words and Ordinals, in: Proc. CALCO 2007, Bergen, LNCS 4624, Springer, 2007, 1-15.
  9. Z. Ésik, W. Kuich: 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.
  10. Sz. Iván: Az iterált shuffle művelet alkalmazása reguláris nyelveken, Alkalmazott Matematikai Lapok, 24(2007), 187-207.
  11. Z. L. Németh: 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.
  12. S. Vágvölgyi: Losing recognizability, Theor. Comput. Sci., 379(2007), 298-304.

2006

  1. Z. Ésik (Ed.): Automata and Formal Languages, Special issue of Theoretical Computer Science, Volume 366, Number 3, 2006.
  2. Z. Ésik, Victor Mitrana, Carlos Martín Vide (Eds.): Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25, Springer-Verlag, 2006.
  3. Z. Ésik (Ed.): Computer Science Logic 2006, Proceedings, LNCS 4207, Springer-Verlag, 2006.
  4. Z. Ésik: Characterizing CTL-like Logics on Finite Trees, Theoretical Computer Science, 356(2006), 136-152.
  5. Z. Ésik: Cascade Products and Temporal Logics on Finite Trees, Electronic Notes in Theoretical Computer Science, Volume 162, 29 September 2006, Pages 163-166.
  6. S. L. Bloom, Z. Ésik: Completing categorical algebras, in: Proc. Fourth IFIP Conf. Theoretical Computer Science, TCS 2006, Springer, 231-250.
  7. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich: Formal languages and automata III: Pushdown automata and algebraic power series, (in Russian), Vestnik Rossiyskogo Gosudarstvennogo Universiteta im. Immanuila Kanta, 2006, No. 10, 8-27.
  8. A. Bertoni, Z. Ésik, J. Karhumäki (Eds.): The art of rationality. In honour of Professor Christian Choffrut on the occasion of his 60th birthday. Theoret. Comput. Sci., 356(2006), 262.
  9. Z. Ésik (Ed.): AFL 05, Special issue of Acta Cybernetica, Volume 17, No.4, 2006.
  10. Z. L. Németh: Automata on infinite biposets, Acta Cybernetica, 17(2006), 765-797.
  11. S. Vágvölgyi: Descendants of a recognizable tree language for sets of linear monadic term rewrite rules, Information Processing Letters, 99(2006), 111-118.

2005

  1. Z. Ésik, Z. Fülöp (Eds.): Automata and Formal Languages 2005, Proceedings of the 11th International Conference, Dobogókő, May 17-20, 2005.
  2. L. Aceto, Z. Ésik, W. Fokkink, A. Ingólfsdóttir (Eds.): Process Algebra, Special issue of Theoretical Computer Science, Vol. 335:2-3(2005).
  3. Z. Ésik, W. Kuich: A semiring-semimodule generalization of $\omega$-regular languages, Part 1, J. Automata, languages, and Combinatorics, 10(2005), 203-242.
  4. Z. Ésik, W. Kuich: A semiring-semimodule generalization of $\omega$-regular languages, Part 2, J. Automata, languages, and Combinatorics, 10(2005), 243-264.
  5. Z. Ésik, H. Leiss: Algebraically complete semirings and Greibach normal form, Annals of Pure and Applied Logic, 103(2005), 173-203.
  6. S. L. Bloom, Z. Ésik: The equational theory of regular words, Information and Computation, 197(2005), 55-89.
  7. Z. Ésik, P. Weil: Algebraic recognizability of regular tree languages, Theoretical Computer Science, 340(2005), 291-321.
  8. Z. Ésik, Z. L. Németh: Algebraic and graph-theoretic properties of infinite $n$-posets, Theoretical Informatics and Applications, 39(2005), 305-322.
  9. Z. Ésik: 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.
  10. Z. Ésik: 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.
  11. Z. Ésik: 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.
  12. Z. Ésik, G. Martin: A note on Wolper's logic, in: Proc. Workshop on Semigroups and Automata, Lisboa, 2005, electronic.
  13. Z. Fülöp, A. Kertész-Farkas, A. Kocsor: Magyar nyelvi korpuszok tömör reprezentációja, Alkalmazott Nyelvtudomány, 1-2(2005), 61-70.
  14. Z. Fülöp, A. Küehnemann, H. Vogler: Linear Deterministic Multi Bottom-up Tree Transducers, Theoret. Comput. Science, 347(2005), 275-287.
  15. Z. Fülöp (Ed.): Proceedings of the 4th Conference for PhD Students (CSCS 04), Special issue of Acta Cybernetica Vol. 17, No. 2, 2005.
  16. Z. Fülöp: An Introduction to Tree Transducers, Formal Methods in Computing (M. Ferenczi, A. Pataricza and L. Rónyai Eds.), Akadémiai Kiadó, Budapest, 2005, 199-258.
  17. Z. Fülöp, L. Muzamel: Recent Results on Pebble Macro Tree Transducers, In. Proc: 1st International Conference on Algebraic Informatics, October 20-23 2005, Thessaloniki, 281-284.
  18. B. Borchardt, Z. Fülöp, Zs. Gazdag, A. Maletti: Bounds for Tree Automata with Polynomial Costs, Journal of Automata, Langauges and Combinatorics, 10(2005), 107-157.
  19. Z. L. Németh: 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.

2004

  1. S. Aleshnikov, J. Boltnev, Z. Ésik, S. Ishanov, W. Kuich, N. Malachovskij: Formal languages and automata II: Continuous semirings and algebraic systems, (in Russian), Vectnik Kaliningradckogo Gocudarctvennogo Universiteta, 2004, No. 4, 19-45.
  2. Z. Ésik, Z. Fülöp (Eds.): Developments in Language Theory, DLT'03, Special issue of Theoretical Computer Science, 327:3(2004).
  3. Z. Ésik, I. Walukiewicz (Eds.): Fixed Points in Computer Science 03, Warsaw, Special issue of Theoretical Informatics and Applications, 38:4(2004).
  4. Z. Ésik, W. Kuich: Inductive $^*$-semirings, Theoret. Comput. Sci, 324(2004), 3--33.
  5. Z. Ésik, S. L. Bloom: Axiomatizing omega and omega-op power on words, Theoretical Informatics and Applications, 38(2004), 3-18.
  6. Z. Ésik, Z. L. Németh: Higher dimensional automata, J. of Automata, Languages and Combinatorics, 9(2004), 3-29.
  7. Z. Ésik, W. Kuich: A semiring-semimodule generalization of $\omega$-context-free languages, Theory is Forever, LNCS 3113, Springer, 2004, 68-80.
  8. Z. Ésik, W. Kuich: 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.
  9. Z. Ésik, W. Kuich: An algebraic generalization of omega-regular languages, in: Proc. MFCS 04, Prague, LNCS 3153, Springer, 2004, 648-659.
  10. Z. Fülöp: Formális nyelvek és szintaktikus elemzésük, Polygon, Szeged, 2nd edition, 2004.
  11. Z. Fülöp, H. Vogler: Weighted Tree Transducers, Journal of Automata, Langauges and Combinatorics, 9(2004), 31-54.
  12. Z. Fülöp, A. Küehnemann, H. Vogler: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Inf. Process. Letters, Inf. Process. Letters, 91(2004), 57-67.
  13. Z. Fülöp, H. Vogler, Zs. Gazdag: Hiererchies of Tree Series Transformations, Theoret. Comput. Science, 314(2004), 387-429.
  14. Z. L. Németh: A hierarchy theorem for regular languages over free bisemigroups, Acta Cybernetica, 16(2004), 567--577.
  15. S. Vágvölgyi: Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems, Bulletin of the EATCS, 82(2004), 269-285.
  16. T. Hornung, S. Vágvölgyi: Storage-to-tree transducers with look-ahead, Theoretical Computer Science, 329(2004), 115-158.

2003

  1. Z. Ésik, A. Ingolfsdottir (Eds.): Fixed Points in Computer Science 02, Copenhagen, Special issue of Theoretical Informatics and Applications, 37(2003), 271-391.
  2. S.I. Aleshnikov, Ju. F. Boltnev, Z. Ésik, S.A. Ishanov, W. Kuich: Formal languages and automata I: Conway semirings and finite automata, (in Russian), Vectnik Kaliningradckogo Gocudarctvennogo Universiteta, No. 3, 2003, 7-38.
  3. S. L. Bloom, Z. Ésik: Axioms for regular words, in: Proc. FST&TCS 03, Mumbai, LNCS 2914, Springer, 2003, 50-61.
  4. Z. Ésik, P. Weil: On logically defined recognizable tree languages, in: Proc. FST&TCS 03, Mumbai, LNCS 2914, Springer, 2003, 195-207.
  5. Z. Ésik, K. G. Larsen: Regular languages defined by Lindstöm quantifiers, Theoretical Informatics and Applications, 37(2003), 179-242.
  6. L. Aceto, Z. Ésik, W. J. Fokkink, A. Ingólfsdóttir (Eds.): Process algebra: Open problems and future directions, PA'03, Bologna, Italy, 21-25 July 2003, BRICS Notes Series NS-03-3, 2003.
  7. Z. Ésik, Z. Fülöp (Eds.): Developments in Language Theory, 7th International Conference, DLT 2003, LNCS 2710, Springer, 2003.
  8. S. L. Bloom, Z. Ésik: Deciding whether the frontier of a regular tree is scattered, Fundamenta Informaticae, 55(2003), 1-21.
  9. S. L. Bloom, Z. Ésik: An extension theorem with an application to formal tree series, J. of Automata, Languages and Combinatorics, 8(2003), 145-185.
  10. Z. Ésik, W. Kuich: Formal tree series, J. of Automata, Languages and Combinatorics, 8(2003), 219-285.
  11. Z. Ésik, M. Ito: Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata, Acta Cybernetica, 16(2003), 1-28.
  12. L. Aceto, Z. Ésik, A. Ingólfsdóttir: Equational theories of tropical semirings, Theoretical Computer Science, 298(2003), 417-469.
  13. J. Brzozowski, Z. Ésik: Hazard algebras, Formal Methods in System Design, 23(2003), 223-256.
  14. Z. Ésik: 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.
  15. Z. Ésik: Free De Morgan bisemigroups and bisemilattices, Algebra Colloquium, 10(2003), 23-32.
  16. L. Aceto, Z. Ésik, A. Ingólfsdóttir: The max-sum algebra of natural numbers has no finite equational basis, Theoretical Computer Science, 293(2003), 169-188.
  17. Z. Fülöp, A. Kertész-Farkas, A. Kocsor: 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.
  18. Z. Fülöp: Fatranszformátorok számítási erejének összehasonlítása, MTA doktori értekezés, MTA, 2003.
  19. Z. Fülöp, H. Vogler: Tree Series Transformations that Respect Copying, Theory of Computing Systems, 36(2003), 247-293.
  20. Z. Fülöp, Zs. Gazdag: Shape Preserving Top-Down Tree Transducers, Theoret. Comput. Science, 304(2003), 315-339.
  21. S. Vágvölgyi: On ground tree transformations and congruences induced by tree automata, Theoretical Computer Science, 304(2003), 449-459.
  22. S. Vágvölgyi: Term rewriting restricted to ground terms, Theoretical Computer Science, 302(2003), 135-165.
  23. S. Vágvölgyi: Intersection of finitely generated congruences over term algebra, Theoretical Computer Science, 300(2003), 209-234.

2002

  1. Z. Ésik, A. Ingólfsdóttir (Eds.): Fixed Points in Computer Science 02, Copenhagen, Preliminary Proceedings, BRICS Notes Series, NS-02-2, 2002.
  2. L. Aceto, Z. Ésik, A. Ingólfsdóttir: A fully equational proof of Parikh's theorem, Theoretical Informatics and Applications, 36(2002), 129-154.
  3. Z. Ésik, W. Kuich: Locally closed semirings, Monatshefte Mathematik, 137(2002), 21-29.
  4. Z. Ésik, W. Kuich: Rationally additive semirings, J. Universal Computer Science, 2(8) 2002, 173-183.
  5. Z. Ésik: Continuous additive algebras and injective simulations of synchronization trees, J. Logic. Comput., 12(2002), 271-300.
  6. P. Dömösi, Z. Ésik: A note on completeness of the $\nu_3$-product, Publ. Math., 60(2002), 539-550.
  7. Z. Ésik: Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Theoretical Computer Science, 273(2002), 225-248.
  8. Z. Ésik, H. Leiss: Greibach normal form in algebraically complete semirings, in: Proc. Computer Science Logic, CSL 2002, Edingurgh, LNCS 2471, Springer, 2002, 135-150.
  9. S. L. Bloom, Z. Ésik: 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.
  10. L. Aceto, Z. Ésik, A. Ingólfsdóttir: Equational axioms for probabilistic bisimilarity, in: Proc. Algebraic Methodology and Software Technology, AMAST 2002, Reunion, LNCS 2422, Springer, 2002, 239-253.
  11. Z. Ésik: 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.
  12. Z. Ésik, Z. L. Németh: Automata on series-parallel biposets, in: Proc. Developments in Language Theory, 5th Int. Conf., LNCS 2295, Springer, 2002, 217-227.
  13. J. Engelfriet, Z. Fülöp, H. Vogler: Bottom-up and Top-down Tree Series Transformations, Journal of Automata, Languages and Combinatorics, 7(2002), 11-70.
  14. Z. Fülöp, A. Terlutte: Iterated Relabeling Tree Transducers, Theoret. Comput. Science, 276(2002), 221-244.
  15. Cs. Szigeti, Z. Fülöp, K. Gulya: Branching-Pattern Analysis of the Dendritic Arborization in the Thalamic Nuclei of the Rat Brain, Acta Biologica Hungarica, 53(2002), 177-186.
  16. Z. Fülöp, H. Vogler: Tree Transducers with Costs, in: Proc. 10th International Conference on Automata and Formal Languages (August 13 - 18, 2002, Debreceni Egyetem, Hungary).
  17. Z. Fülöp: Generalizations of Tree Transducers to Tree Series Transducers (abstract), in: Proc. International Workshop "Weighted Automata: Theory and Applications" , Dresden University of Technology, 2002.
  18. C. Campeanu, K. Salomaa, S. Vágvölgyi: Shuffle Decompositions of Regular Languages, International Journal of Foundations of Computer Science, 13(2002), 799-816.

2001

  1. S. L. Bloom, Z. Ésik, A. Labella, E. Manes: Iteration 2-theories, Applied Categorical Structures, 9(2001), 173-216.
  2. P. Dömösi, Z. Ésik: Homomorphic Simulation and Letichevsky's Criterion, J. of Automata, Languages and Combinatorics, 6(2001), 427-436.
  3. Z. Ésik, W. Kuich: 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.
  4. S. Crvenkovic, I. Dolinka, Z. Ésik: On equations for union-free regular languages, Information and Computation, 164(2001), 152-172.
  5. L. Aceto, Z. Ésik, A. Ingólfsdóttir: 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.
  6. Z. Ésik: 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, (co:-author: J. Brzozowski and Y. Iland).
  7. L. Aceto, Z. Ésik, A. Ingólfsdóttir: 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.
  8. J. A. Brzozowski, Z. Ésik: Hazard algebras, in: Half Century of Automata Theory, London, ON, 2000, World Scientific, Singapore, 2001, 1-19.
  9. Z. Fülöp, G. Dányi: The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammar Systems, Theoret. Comput. Science, 262(2001), 229-240.
  10. Z. Fülöp: Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers, Journal of Automata, Languages and Combinatorics 6(2001), 145-189.
  11. Z. Fülöp, S. Vágvölgyi: Restricted Ground Tree Transducers, Theoret. Comput. Science, 250(2001), 219-233.
  12. J. Apró, S. Vágvölgyi: The Ground Tree Transducer Game with Identical Tree Automata, Fundamenta Informaticae, 45(2001) 157-172.