Formal Translations Described by Translation Grammars with LR(k) Input Grammars. - Jan Janousek; Borivoj Melichar (PLILP, 1997)

The Output-Store Formal Translator Directed by LR Parsing. - Jan Janousek; Borivoj Melichar (SOFSEM, 1997)

Even faster generalized LR parsing. - John Aycock; R. Nigel Horspool; Jan Janousek; Borivoj Melichar (Acta Informatica, 2001)

Subtree matching by deterministic pushdown automata. - Tomás Flouri; Borivoj Melichar; Jan Janousek (IMCSIT, 2009)

String Suffix Automata and Subtree Pushdown Automata. - Jan Janousek (Stringology, 2009)

On regular tree languages and deterministic pushdown automata. - Jan Janousek; Borivoj Melichar (Acta Informatica, 2009)

Aho-Corasick like multiple subtree matching by pushdown automata. - Tomás Flouri; Borivoj Melichar; Jan Janousek (SAC, 2010)

Subtree matching by pushdown automata. - Tomás Flouri; Jan Janousek; Borivoj Melichar (Comput. Sci. Inf. Syst., 2010)

Tree Indexing by Pushdown Automata and Repeats of Subtrees. - Tomás Flouri; Jan Janousek; Borivoj Melichar; Costas S. Iliopoulos; Solon P. Pissis (FedCSIS, 2011)

Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. - Martin Plicka; Jan Janousek; Borivoj Melichar (FedCSIS, 2011)

Nonlinear Tree Pattern Pushdown Automata. - Jan Travnicek; Jan Janousek; Borivoj Melichar (FedCSIS, 2011)

Computing All Subtree Repeats in Ordered Ranked Trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (SPIRE, 2011)

Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. - Jan Travnicek; Jan Janousek; Borivoj Melichar (Comput. Sci. Inf. Syst., 2012)

Computing all subtree repeats in ordered trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (Inf. Process. Lett., 2012)

Tree template matching in ranked ordered trees by pushdown automata. - Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (J. Discrete Algorithms, 2012)

Tree compression pushdown automaton. - Jan Janousek; Borivoj Melichar; Martin Poliak (Kybernetika, 2012)

Arbology: Trees and pushdown automata. - Borivoj Melichar; Jan Janousek; Tomás Flouri (Kybernetika, 2012)

Tree template matching in unranked ordered trees. - Michalis Christou; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis; Jan Zdárek (J. Discrete Algorithms, 2013)

A Full and Linear Index of a Tree for Tree Patterns. - Jan Janousek; Borivoj Melichar; Radomír Polách; Martin Poliak; Jan Trávnícek (DCFS, 2014)

A Study of Random Neural Network Performance for Supervised Learning Tasks in CUDA. - Sebastián Basterrech; Jan Janousek; Václav Snásel (ECC (2), 2014)

Efficient Description and Cache Performance in Aspect-Oriented User Interface Design. - Tomás Cerný; Miroslav Macik; Michael J. Donahoo; Jan Janousek (FedCSIS, 2014)

Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton. - Jan Janousek; Jaroslav Málek (SLATE, 2014)

Clustering using artificial bee colony on CUDA. - Jan Janousek; Jan Platos; Václav Snásel (SMC, 2014)

Classification via Nearest Prototype Classifier Utilizing Artificial Bee Colony on CUDA. - Jan Janousek; Petr Gajdos; Michal Radecký; Václav Snásel (SOCO-CISIS-ICEUTE, 2014)

Application of Bio-inspired Methods Within Cluster Forest Algorithm. - Jan Janousek; Petr Gajdos; Michal Radecký; Václav Snásel (AECIA, 2015)

A new algorithm for the determinisation of visibly pushdown automata. - Radomír Polách; Jan Travnicek; Jan Janousek; Borivoj Melichar (FedCSIS, 2015)

Gaussian Mixture Model Cluster Forest. - Jan Janousek; Petr Gajdos; Michal Radecký; Václav Snásel (ICMLA, 2015)

Backward Linearised Tree Pattern Matching. - Jan Trávnícek; Jan Janousek; Borivoj Melichar; Loek G. Cleophas (LATA, 2015)

Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents. - Eliska Sestáková; Jan Janousek (SLATE, 2015)

On distributed concern delivery in user interface design. - Tomás Cerný; Miroslav Macik; Michael J. Donahoo; Jan Janousek (Comput. Sci. Inf. Syst., 2015)

Fast Human Activity Recognition Based on a Massively Parallel Implementation of Random Forest. - Jan Janousek; Petr Gajdos; Pavel Dohnálek; Michal Radecký (ACIIDS (2), 2016)

Efficient determinization of visibly and height-deterministic pushdown automata. - Radomír Polách; Jan Trávnícek; Jan Janousek; Borivoj Melichar (Comput. Lang. Syst. Struct., 2016)

Towards power plant output modelling and optimization using parallel Regression Random Forest. - Jan Janousek; Petr Gajdos; Pavel Dohnálek; Michal Radecký (Swarm Evol. Comput., 2016)

Indexing XML Documents Using Tree Paths Automaton. - Eliska Sestáková; Jan Janousek (SLATE, 2017)

Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. - Tomás Pecka; Jan Trávnícek; Radomír Polách; Jan Janousek (SLATE, 2018)

Constrained Approximate Subtree Matching by Finite Automata. - Eliska Sestáková; Borivoj Melichar; Jan Janousek (Stringology, 2018)

Automata Approach to XML Data Indexing. - Eliska Sestáková; Jan Janousek (Inf., 2018)

QDSOMA: Towards the Utilization of Quantum Computing within SOMA. - Petr Gajdos; Marek Behálek; Jan Janousek; Pavel Krömer (CEC, 2019)

Random Key Self-Organizing Migrating Algorithm for Permutation Problems. - Pavel Krömer; Jan Janousek; Jan Platos (CEC, 2019)

On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. - Stepán Plachý; Jan Janousek (SOFSEM, 2020)

Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. - Tomás Pecka; Jan Trávnícek; Jan Janousek (Stringology, 2020)

On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. - Jan Trávnícek; Jan Janousek; Borivoj Melichar; Loek Cleophas (Theor. Comput. Sci., 2020)

Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. - Eliska Sestáková; Ondrej Guth; Jan Janousek (Stringology, 2021)

On the Smallest Synchronizing Terms of Finite Tree Automata. - Václav Blazej; Jan Janousek; Stepán Plachý (CIAA, 2023)

Inexact tree pattern matching with 1-degree edit distance using finite automata. - Eliska Sestáková; Ondrej Guth; Jan Janousek (Discret. Appl. Math., 2023)

Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. - Jan Janousek; Stepán Plachý (SOFSEM, 2024)

Forward linearised tree pattern matching using tree pattern border array. - Jan Trávnícek; Tomás Pecka; Robin Oburka; Jan Janousek (Discret. Appl. Math., 2024)

Decreasing verification radius in local certification. - Laurent Feuilloley; Jan Janousek; Jan Matyás Kristan; Josef Erik Sedlácek (Theor. Comput. Sci., 2025)