ΟΛΥΜΠΙΑ ΛΟΥΣΚΟΥ ΜΠΟΖΑΠΑΛΙ ΟΥ ιδάκτωρ Μαθηµατικών Αναπληρώτρια Καθηγήτρια ΤΕΙ υτικής Μακεδονίας ΒΙΟΓΡΑΦΙΚΟ
ΒΙΟΓΡΑΦΙΚΟ ΣΗΜΕΙΩΜΑ Ολυµπία Λούσκου Μποζαπαλίδου Αναπληρώτρια Καθηγήτρια e-mail:olouskou@teikoz.gr Αποφοίτησα από το Μαθηµατικό Τµήµα του Πανεπιστηµίου Ιωαννίνων το 1979. Τον Ιούνιο του 1994 ανακηρύχτηκα ιδάκτωρ του Τµήµατος Μαθηµατικών του Αριστοτελείου Πανεπιστηµίου Θεσσαλονίκης. Τον Φεβρουάριο του 2004 ορκίστηκα ως Επίκουρη Καθηγήτρια στο ΤΕΙ υτικής Μακεδονίας και µονιµοποιήθηκα στη θέση αυτή τον Μάρτιο του 2007. Τον Απρίλιο του 2009 εκλέχθηκα Αναπληρώτρια Καθηγήτρια στο ΤΕΙ υτικής Μακεδονίας όπου υπηρετώ µέχρι σήµερα. Επιστηµονικές ηµοσιεύσεις 1. The rank of a formal tree power series. Theoretical Computer Science vol. 27(1983) pp. 211-215, Elsevier (with S.Bozapalidis) 2. Συµβολή στη Θεωρία των συναρτήσεων δένδρου. ιδακτορική διατριβή, Τµήµα Μαθηµατικών, Αριστοτέλειο Πανεπιστήµιο Θεσσαλονίκης, 1994 3. Contex free closed families of languages. International Journal of Computer Mathematics, vol. 48 (1992), pp. 1-7, Gordon and Breach 4. Stochastic Tree Functions. International Journal of Computer Mathematics, vol. 52(1994) pp. 149-160. Gordon and Breach 5. Stochastically costed tree automata: Turakainen s theorem. Theoretical Computer Science 156(1996) pp. 145-158, Elsevier 6. Costochastic tree Automata and Convexly algebraic series. Journal Institute Mathematics and Computer Science, Comp. Sci. Ser. Vol. 8, No 1(1997) pp.13-21 7. Some remarks on recognizanle series on trees. International Journal of Mathematics, Vol. 70, (1999), pp. 649-655 8. Polypodic codes (with S.Bozapalidis), Theoretical Informatics and Applications, Theoret. Informatics Appl. 36(2002) 5-28, pp.1-28. 9. Finitely Presentable Tree Series (with S.Bozapalidis), Acta Cybernetica vol. 17(2006) 459-470. 10. On the Recognizability of Fuzzy Languages I (with S.Bozapalidis), Fuzzy Sets and Systems, 157(2006) 2394-2402.
11. Fuzzy Congruences on Fuzzy Algebras, Applied Mathematical Sciences, Vol. 1, 2007, no. 17, 815-819. 12. Non Deterministic Recognizability of Fuzzy Languages, Applied Mathematical Sciences, Vol. 1, 2007, no. 17, 821-826. 13. Immune-based Transformations (with S.Bozapalidis, A.Kalampakas, G.Rahonis), Report, Immunocomputing Project. 14. On the recognizability of fuzzy languages II, (with S. Bozapalidis), Fuzzy Sets and Systems, 159(2008) 107-113. 15. Stochastic Monoids. Applied Mathematical Sciences, Vol. 3, 2009, no.9, pp.443-446. 16. Fuzzy Tree Language Recognizability (with S. Bozapalidis), Fuzzy Sets and Systems, 161(2010) 716-734. Aναφορές στις εργασίες Ι. Αναφορές στην εργασία 1 1. I. Τσοµώκος, Κ-Σ- ενδροαυτόµατα, διδακτορική διατριβή, Πανεπιστήµιο Ιωαννίνων (1986) 2. I. Tsomokos, K-Σ-Treeautomata and their relation to weighted context free grammars, International Journal of Computer Mathematics, 26(1989) pp.91-99 3. F. Gecseg and M. Steinby, Tree Languages, Handbook in Formal Language Theory, vol.iii(1996) pp.1-68, Springer-Verlag. 4. R.E. Block, G. Griffing, Recognizable Formal Series on Trees and Cofree Coalgebraic Systems, Journal of Algebra 215, 543-573 (1999). 5. I. Meinecke, Weighted Branching Automata Combining Concurrency and Weights, Dissertation, Technischen Universität Dresden, 2004. 6. Zoltan Fülöp and Heiko Vogler, Weighted Tree Automata and Tree Series Transducers, Handbook of Weighted Automata, Chapter 9, Springer 2008. 7. Andreas Maletti, Tree-Series-to-Tree-Series Transformations. International Computer Science Institute, Berkeley CA USA (2008). 8. Andreas Maletti, Minimizing Deterministic Weighted Tree Automata. International Computer Science Institute, Berkeley, CA, USA (2008). 9. Zoltan Fülop and Magnus Steinby, Varieties of Recognizable Tree Series over Fields. Theoretical Computer Science,2011-Elsevier. 10. Zoltan Fülöp, M. Steinby, Formal series of general algebras over a field and their syntactic algebras, in: Z. Esik and Z. Fülöp (Eds.), Automata, Formal Languages and Related Topics, University of Szeged, Szeged 2009, 55-78. 11. Mathissen C., Definable transductions and weighted logics for texts. 2007- Springer.
12. Bozapalidis S., Representable tree series. Fundamenta Informaticae, 1994 IOS Press. 13. Mathissen C., Weighted Automata and Weighted Logics over Tree-like Structures. 2009-informatic.uni-leipzig.de, book. 14. Bozapalidis S., Kalampakas A., On the syntactic complexity of tree series. Theoretical Informatics and Applications, 2010- Cambridge Univ Press. 15. Droste M., Götze D., Märcker S., Meinecke I., Weighted tree automata over valuation monoids and their characterization by weighted logics. Algebraic Foundations in Computer Science,2011- Springer. 16. C. Mathissen, Definable transductions and weighted logics for texts. Theoretical Computer Sciense, 2010- Elsevier. 17. Maletti A., Myhill-Nerode theorem for recognizable tree series revisited. LATIN 2008: Theoretical Informatics, 2008-Springer. 18. Bozapalidis S., Ioulidis S., Actions, finite state sets and applications to trees. International Journal of Computer Science, 1989- Taylor & Francis 19. Bozapalidis S., Constructions effectives sur les séries formelles d arbres. Theoretical Computer Science, 1990-Elsevier. 20. Bozapalidis S., Quantum Recognizable Tree Functions. Unconventional Models of Computation, UMC 2K, 2001-books.google.com. 21. Maletti A., Quernheim D., Pushing for Weighted tree automata. Mathematical Foundations of Computer Science, 2011-Springer. 22. Lagoutte A., Survey: Weighted Extended Top-Down Tree Transducers Part III Composition. Algebraic Foundations in Computer Science, 2011- Springer. 23. Esik Z., Hajgato T., Kleene Theorem in Partial Conway Theories with Applications. Algebraic Foundations in Computer Science, 2011- Springer. 24. Fichtner I., Mathissen C., Rational transformations and a kleene theorem for power series over rational monoids. Algebraic Foundations in Computer Science, 2011- Springer. 25. Lagoutte A., Internship Report Compositions of Extended Top-down Tree Transducers.-perso.ens-lyon.fr 26. Maletti A., Minimizing weighted tree grammars using simulation. Finite- State Methods and Natural Language, 2010 Springer. ΙΙ. Αναφορές στην εργασία 4 27. R.E. Block, G. Griffing, Recognizable Formal Series on Trees and Cofree Coalgebraic Systems, Journal of Algebra 215, 543-573 (1999).
ΙΙΙ. Αναφορές στην εργασία 5 28. R.E. Block, G. Griffing, Recognizable Formal Series on Trees and Cofree Coalgebraic Systems, Journal of Algebra 215, 543-573 (1999). 29. S. Bozapalidis, Convex algebras, convex modules and formal power series on trees, Journal of Automata, Languages and Combinatorics 1(1996) 3, 165-180. 30. Z. EsiK, W. Kuich, Formal Tree Series, Journal of Automata, Languages and Combinatorics, 2003. IV. Αναφορές στην εργασία 7 31. M. Droste and H. Vogler, Weighted Tree Automata and Weighted Logics, Theoretical Computer Science, 366(3), pp.228-247(2006). V. Αναφορές στην εργασία 8 32. Andreas Maletti, The Power of Tree Series Transducers. Dissertation, Fakultät Informatik, Technischen Universität Dresden (2006). VI. Αναφορές στην εργασία 9 33. Droste M., Götze D., Märcker S., Meinecke I., Weighted tree automata over valuation monoids and their characterization by weighted logics. Algebraic Foundations in Computer Science,2011- Springer. VII. Αναφορές στην εργασία 10 34. G.Rahonis, Fuzzy Languages, In Handbook of Weighted Automata, eds: 35. Jelena Ignjatovic, Miroslav Ciric, Stoyan Bogdanovic, Determinization of fuzzy automata with membership values in complete residuated lattices, Information Sciences 178(2008) 164-180. 36. B. Seselja, A.Tepavcevic, H.Vogler, A note on cut worthiness of recognizable tree series, Fuzzy Sets and Systems,2008-Elsevier. 37. Α. Λουκάκης, Αναγνωρισιµότητα Ασαφών Γλωσσών, ιπλωµατική εργασία, Τµήµα Μαθηµατικών Α.Π.Θ. (2008).
38. Wang Y., Li Y., Approximation of fuzzy context-free grammars. Information Sciences, volume 179, issue 22, 2009, pp.3920-3929. 39. Ignjatovic J., Ciric M., Formal power series and regular operations on fuzzy languages. Information Sciences, volume 180, issue7, year 2010, pp. 1104 1120. 40. Ciric M., Droste M., Ignjatovic J., Vogler H., Determinization of weighted finite automata over strong bimonoids. Information Sciences,vol.180, Issue 18, pp. 3497-3520 (2010). 41. Ignjatovic J., Ciric M., Bogdanovic S., Petkovic T., Myhill- Nerode type theory for fuzzy languages and automata. Fuzzy sets and Systems, 2010-Elsevier 42. Jancic Z., Ignjatovic J.,Ciric M., An improved algorithm for determinization of weighted and fuzzy automata. Information Sciences, 2011-Elsevier. 43. Rajaretnam T., Ayyaswamy SK., Fuzzy Monoids in a Fuzzy Finite State Automaton with Unique Mempership Transition on an Input Sympol.Veltechuniv edu.in 44.Cirik M., Ignjatovic J., Algebraic Theory of lattice-valued fuzzy languages and automata. LINZ, 2008 fill.jku.at 45.Kalampakas A., Spartalis S., Iliadis L., Fuzzy graph Language Recognizability. Artificial Intelligence Applications (to appear).2012- Springer. 46.Stamenkovic A., Fazi automati I fazi regularni izrazi. Pmf.ni.ac.rs 47.Αξιολόγηση των πηγών πληροφόρησης στις βιοïατρικές επιστήµες. Ι Βιβλιοθήκη, Γ Νοσοκοµείο, ΤΒ ΚΑΤ, ΤΕΙ Αθήνας- mednet.gr VIII. Αναφορές στην εργασία 11 48. G.Rahonis, Fuzzy Languages, In Handbook of Weighted Automata, eds: IX. Αναφορές στην εργασία 12 49. G.Rahonis, Fuzzy Languages, In Handbook of Weighted Automata, eds: X. Αναφορές στην εργασία 14 50. G.Rahonis, Fuzzy Languages, In Handbook of Weighted Automata, eds: 51. Α. Λουκάκης, Αναγνωρισιµότητα Ασαφών Γλωσσών, ιπλωµατική εργασία, Τµήµα Μαθηµατικών Α.Π.Θ. (2008).
52. Ignjatovic J., Ciric M., Formal power series and regular operations on fuzzy languages. Information Sciences, volume 180, issue7, year 2010, pp. 1104 1120. 53. Ciric M., Droste M., Ignjatovic J., Vogler H., Determinization of weighted finite automata over strong bimonoids. Information Sciences, vol.180, Issue 18, pp. 3497-3520, year 2010. 54. Ignjatovic J., Ciric M., Bogdanovic S., Petkovic T., Myhill- Nerode type theory for fuzzy languages and automata. Fuzzy sets and Systems, 2010-Elsevier. 55. Jancic Z., Ignjatovic J.,Ciric M., An improved algorithm for determinization of weighted and fuzzy automata. Information Sciences, 2011-Elsevier. 56. Rajaretnam T., Ayyaswamy SK., Fuzzy Monoids in a Fuzzy Finite State Automaton with Unique Mempership Transition on an Input Sympol.Veltechuniv edu.in 57. Cirik M., Ignjatovic J., Algebraic Theory of lattice-valued fuzzy languages and automata. LINZ, 2008 fill.jku.at 58. Kalampakas A., Spartalis S., Iliadis L., Fuzzy graph Language Recognizability. Artificial Intelligence Applications (to appear),2012- Springer. XI. Αναφορές στην εργασία 16 59. Ciric M., Droste M., Ignjatovic J., Vogler H., Determinization of weighted finite automata over strong bimonoids. Information Sciences, vol. 180, Issue 18, pp.3497-3520, year 2010. 60. Droste M., Götze D., Märcker S., Meinecke I., Weighted tree automata over valuation monoids and their characterization by weighted logics. Algebraic Foundations in Computer Science,2011- Springer. 61. Jancic Z., Ignjatovic J.,Ciric M., An improved algorithm for determinization of weighted and fuzzy automata. Information Sciences, 2011-Elsevier. 62. Kalampakas A., Spartalis S., Iliadis L., Fuzzy graph Language Recognizability. Artificial Intelligence Applications (to appear),2012- Springer. 63. Ghorani M., Zahedi MM., Characterizations of complete residuated latticevalued finite tree automata. Fuzzy Sets and Systems, 2011- Elsevier 64. Moghari S., Zahedi MM., Ameri R., Minimization of Fuzzy Finite Tree Automata. research.utar.edu.my 65. Ghorani M., Zahedi MM., Ameri R., Algebraic properties of complete residuated lattice valued tree automata. Soft Computing A Fusion of Foundations..2012- Springer. 66. Moghari S., Zahedi MM., Ameri R., Efficient Reduction of Fuzzy Finite Tree Automata. research. utar.edu.my