Jan Janousek

Stepán Plachý

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Inexact tree pattern matching with 1-degree edit distance using finite automata.

[BibT_eX]

[DOI]

Ondrej Guth

Discret. Appl. Math., May, 2023

On the Smallest Synchronizing Terms of Finite Tree Automata.

[BibT_eX]

[DOI]

Václav Blazej

Stepán Plachý

Proceedings of the Implementation and Application of Automata, 2023

2021

Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance.

[BibT_eX]

[DOI]

Ondrej Guth

Proceedings of the Prague Stringology Conference 2021, 2021

2020

On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination.

[BibT_eX]

[DOI]

Tomás Pecka

Jan Trávnícek

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching.

[BibT_eX]

[DOI]

Stepán Plachý

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Random Key Self-Organizing Migrating Algorithm for Permutation Problems.

[BibT_eX]

[DOI]

Pavel Krömer

Jan Platos

Proceedings of the IEEE Congress on Evolutionary Computation, 2019

QDSOMA: Towards the Utilization of Quantum Computing within SOMA.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018

Automata Approach to XML Data Indexing.

[BibT_eX]

[DOI]

Inf., 2018

Constrained Approximate Subtree Matching by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression.

[BibT_eX]

[DOI]

Proceedings of the 7th Symposium on Languages, Applications and Technologies, 2018

2017

Indexing XML Documents Using Tree Paths Automaton.

[BibT_eX]

[DOI]

Proceedings of the 6th Symposium on Languages, Applications and Technologies, 2017

2016

Towards power plant output modelling and optimization using parallel Regression Random Forest.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2016

Efficient determinization of visibly and height-deterministic pushdown automata.

[BibT_eX]

[DOI]

Comput. Lang. Syst. Struct., 2016

Fast Human Activity Recognition Based on a Massively Parallel Implementation of Random Forest.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015

On distributed concern delivery in user interface design.

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2015

Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Languages, Applications and Technologies - 4th International Symposium, 2015

Backward Linearised Tree Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Gaussian Mixture Model Cluster Forest.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015

A new algorithm for the determinisation of visibly pushdown automata.

[BibT_eX]

[DOI]

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

Application of Bio-inspired Methods Within Cluster Forest Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Second International Afro-European Conference for Industrial Advancement, 2015

2014

Classification via Nearest Prototype Classifier Utilizing Artificial Bee Colony on CUDA.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference SOCO'14-CISIS'14-ICEUTE'14, 2014

Clustering using artificial bee colony on CUDA.

[BibT_eX]

[DOI]

Jan Platos

Václav Snásel

Proceedings of the 2014 IEEE International Conference on Systems, Man, and Cybernetics, 2014

Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton.

[BibT_eX]

[DOI]

Jaroslav Málek

Proceedings of the 3rd Symposium on Languages, Applications and Technologies, 2014

Efficient Description and Cache Performance in Aspect-Oriented User Interface Design.

[BibT_eX]

[DOI]

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

A Study of Random Neural Network Performance for Supervised Learning Tasks in CUDA.

[BibT_eX]

[DOI]

Sebastián Basterrech

Václav Snásel

Proceedings of the Intelligent Data analysis and its Applications, Volume II, 2014

A Full and Linear Index of a Tree for Tree Patterns.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Tree template matching in unranked ordered trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

2012

Arbology: Trees and pushdown automata.

[BibT_eX]

[DOI]

Kybernetika, 2012

Tree compression pushdown automaton.

[BibT_eX]

[DOI]

Martin Poliak

Kybernetika, 2012

Tree template matching in ranked ordered trees by pushdown automata.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Computing all subtree repeats in ordered trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata.

[BibT_eX]

[DOI]

Jan Travnicek

Comput. Sci. Inf. Syst., 2012

2011

Computing All Subtree Repeats in Ordered Ranked Trees.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

Nonlinear Tree Pattern Pushdown Automata.

[BibT_eX]

[DOI]

Jan Travnicek

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.

[BibT_eX]

[DOI]

Martin Plicka

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Tree Indexing by Pushdown Automata and Repeats of Subtrees.

[BibT_eX]

[DOI]

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

2010

Subtree matching by pushdown automata.

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2010

Aho-Corasick like multiple subtree matching by pushdown automata.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009

On regular tree languages and deterministic pushdown automata.

[BibT_eX]

[DOI]

Acta Informatica, 2009

String Suffix Automata and Subtree Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Subtree matching by deterministic pushdown automata.

[BibT_eX]

[DOI]

Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

2001

Even faster generalized LR parsing.

[BibT_eX]

[DOI]

Acta Informatica, 2001

1997

The Output-Store Formal Translator Directed by LR Parsing.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Formal Translations Described by Translation Grammars with LR(k) Input Grammars.

[BibT_eX]

[DOI]