M@ttuz

All Final
 

Publication here and also at DBLP computer science bibliography :

  • I am always open to chatting about interesting topics. Please feel free to send me an email: palmovsky(*at*)saske(*dot*)sk

  • Journal Paper


    1. - Matus Palmovsky: Kleene closure and state complexity. RAIRO – Theoretical Informatics and Application 50(3), 251–261 (2016), link RAIRO_ITA

    Related Published Papers


    1. - Galina Jirásková, Matúš Palmovský: Kleene closure and state complexity. In: Vinař T. (ed.) Proceedings of the Conference on Information Technologies - Applications and Theory, Slovakia, September 11-15, 2013, ITAT 2013,CEUR Workshop Proceedings, vol. 1003, pp. 94–100. CEUR-WS.org (2013)

    2. - Galina Jirásková, Matúš Palmovsky, Juraj Šebej: Kleene closure on regular and prefix-free languages. In: Holzer M., Kutrib M. (eds.) Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8587, pp. 226–237. Springer (2014)

    3. - Galina Jirásková,Matúš Palmovský, Juraj Šebej, Peter Mlynárčik, Kristína Čevorová: Operations on automata with all states final. In: Ésik Z.,Fül.p Z. (eds.) Proceedings, 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014,EPTCS, vol. 151, pp. 201–215.

    4. - Matúš Palmovský, Juraj Šebej: Star-complement-star on prefix-free languages. In: Shallit J., Okhotin A. (eds.) Descriptional Complexity of Formal Systems -17th International Workshop, DCFS 2015, Waterloo, ON,Canada, June 25-27, 2015. Proceedings, Lecture Notes in Computer Science,vol. 9118, pp. 231–242. Springer (2015)

    5. - Hae-Sung Eom, Matúš Palmovský: Combined operations on prefix-free and suffix-free languages.In: Bordihn H., Freund R., Nagy B., Vaszil Gy. (eds.) Eighth Workshop on Non-Classical Models of Automata and Applications,NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings,books@ocg.at, vol. 321, pp. 147–162. Österreichische Computer Gesellschaft(2016)

    6. - Jozef Jirásek, Jr., Matúš Palmovský, Juraj Šebej: Kuratowski algebras generated by suffix-, factor-, and subword-free languages. In: Pighizzini G., Câmpeanu C. (eds.) Descriptional Complexity of Formal Systems - 19th International Conference, DCFS 2017, Italy, Milano, June 3-5, 2017. Proceedings, Lecture Notes in Computer Science, vol. 10316, pp. 189–201. Springer (2017), Cham

    7. - Matúš Palmovský, Galina Jirásková: Star-complement-star and Kuratowski algebras on prefix-free languages. In: Mráz F., Freund R., Prusa D. (eds.) Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Proceedings,books@ocg.at, ISBN 978-3-903035-18-8, pp. 151–164. Österreichische Computer Gesellschaft (2017)