2008

Janousek, J., Melichar, B. On Regular Tree Languages and Deterministic Pushdown Automata. In Acta Informatica, Vol. 46, No. 7, pp. 533-547, Springer, 2009. Available online here.

2009

Melichar, B., Janousek, J., Flouri T. Arbology - Basic Notions. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 11. Slides.

Janousek, J., Melichar, B. Subtree and Tree Pattern Pushdown Automata for Trees in Prefix Notation. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 9. Slides.

Flouri, T., Melichar, B., Janousek, J. Tree Pattern Matching by Pushdown Automata. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 5. Slides.

Melichar, B., Janousek, J. Repeats in Trees and Pushdown Automata. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 12. Slides.

Janousek, J. String Suffix Automata and Subtree Pushdown Automata. In:
Proceedings of the Prague Stringology Conference 2009, pp. 160--172, Czech Technical University in Prague, Prague, 2009. Abstract. Available online here.

Flouri, T., Janousek , J., Melichar, B. Subtree Matching by Deterministic Pushdown Automata. In: Proceedings of the IMCSIT, Vol. 4, IEEE Computer Society Press, pp. 659-666, 2009. Abstract.

2010

Flouri, T., Janousek , J., Melichar, B. Subtree matching and pushdown automata. In: COMSIS, Vol. 7, No.2, pp. 331-357, ComSIS Consortium, 2010. Abstract.

Flouri, T., Janousek , J., Melichar, B. Aho-Corasick like multiple subtree matching by deterministic pushdown automata. In: ACM SAC 2010 conference, 2009.

Flouri, T., Janousek , J., Melichar, B . Approximate Subtree Matching by Pushdown Automata. Presentation at LSD 2010 conference, London, 2010. Abstract.

Plicka, M., Janousek , J., Melichar, B. Oracle Subtree Pushdown Automata for Trees. Presentation at LSD 2010 conference, London, 2010. Abstract. Slides.

Stoklasa, J., Janousek , J., Melichar, B.Subtree Pushdown Automata for Trees in Bar Notation. Presentation at LSD 2010 conference, London, 2010. Abstract. Slides.

Melichar, B. Arbology: Trees and pushdown automata. In: LATA 2010 (LNCS 6031), invited speaker, pp. 32-49, Springer, 2010. Available online here.

Flouri, T. Searching in Tree Structures. PhD thesis proposal report. Defended in CTU FEE Prague, 2010.

Janousek, J. Arbology: Algorithms on Trees and Pushdown Automata. Habilitation thesis, TU FIT Brno, 161 pages, 2010.

Lahoda, J., Zdarek, J. : Simple Tree Pattern Matching for Trees in Prefix Bar Notation. In: Proceedings of the Prague Stringology Conference 2010, pp. 25--36, Czech Technical University in Prague, Prague, 2010.

2011

T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar and S. P. Pissis. Tree Template Matching. Presentation at LSD 2011 conference, London, 2011.

Poliak, M., Janousek , J., Melichar, B. Tree Compression Pushdown Automaton. Presentation at LSD 2011 conference, London, 2011.

Janousek J, Plicka M., Poliak, M., Travnicek, J. A series of presentations at conference Words, Numeration and Automata, Prague 2011.

Žďárek, J., Melichar, B.: A Note on a Tree-Based 2D Indexing. In: Proceedings of CIAA 2010, LNCS 6482, Springer, pp. 300–309. Available online here.

Tomas Flouri, Costas Iliopoulos, Jan Janousek, Borivoj Melichar and Solon Pissis. Tree Template Matching in Ranked, Ordered Trees by Pushdown Automata. In: LNCS 6807 (CIAA 2011). Springer, pp. 273 - 281, 2011.

Travnicek, J. , Janousek, J., Melichar, B. Nonlinear Tree Pattern Pushdown Automata. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 871-878, 2011.

Plicka, M. , Janousek, J., Melichar, B. Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 903-906, 2011.

Flouri, T. , Iliopoulos, C., Janousek, J., Melichar, B., Pissis, S. Tree Indexing by Pushdown Automata and Repeats of Subtrees. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 899-902, 2011.

Christou, M., Crochemore, M., Flouri, T. Iliopoulos, C. Pissis, S. Janousek, J., Melichar, B. Computing all Subtree Repeats in Ordered Ranked Trees. In: LNCS 7024 (SPIRE 2011). Springer, pp. 338 - 343, 2011.

Polach, R., Janousek, J., Melichar, B. Tree expressions and pushdown automata, In: MEMICS 2011, Brno UT, pp. 70-77, 2011.

2012

Travnicek, J., Janousek , J., Melichar, B. Indexing for nonlinear tree pattern matching and its implementation. Presentation at LSD 2012 conference, London, 2012.

Melichar, B., Janousek, J., Flouri, T. Arbology: Trees and Pushdown Automata. In: Kybernetika, vol. 48, No.3, pp. 402-428, 2012.

Poliak, M., Janousek, J., Melichar, B. Tree Compression Pushdown Automaton. In: Kybernetika, vol. 48, No.3, pp. 429-452, 2012.

Travnicek, J., Janousek , J., Melichar, B. Indexing Ordered Trees for (Nonlinear) Tree Pattern Matching by Pushdown Automata. COMSIS, pp. 1125-1153, 2012.

Christou, M., Crochemore, M., Flouri, T. Iliopoulos, C. Pissis, S. Janousek, J., Melichar, B. Computing all subtree repeats of ordered trees. Inf. Process. Lett. 112(24), pp. 958-962, Elsevier, 2012.

. 2013

Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis: Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17, pp. 15-23, Elsevier, 2013.

Janousek , J. .Tree Indexing by Deteministic Automata. In: Dagstuhl reports, Vol.3, No. 5 (Tree Transducers and Formal Methods), Dagstuhl, p.6, 2013.

. 2014

Jan Janousek, Jaroslav Malek: Target Code Selection by Tilling AST with the
Use of Tree Pattern Pushdown Automaton. In: Proceeding of SLATE 2014, Dagtuhl, pp. 159-165, 2014.

Jan Janousek, Borivoj Melichar, Radomır Polach, Martin Poliak, Jan Travnıcek: A Full and Linear Index of a Tree for Tree Patterns. In: LNCS 8614 (DCFS 2014), Springer, pp. 198-209, 2014.

2015

Jan Travnicek, Jan Janousek, Borivoj Melichar and Loek G. Cleophas: Backward Linearised Tree Pattern Matching. In: LNCS 8977 (LATA 2015), Springer, pp. 599-610, 2015.