Volgen
Jan Trávníček
Jan Trávníček
Faculty of Information Technology, Czech Technical University
Geverifieerd e-mailadres voor fit.cvut.cz
Titel
Geciteerd door
Geciteerd door
Jaar
A full and linear index of a tree for tree patterns
J Janoušek, B Melichar, R Polách, M Poliak, J Trávníček
International Workshop on Descriptional Complexity of Formal Systems, 198-209, 2014
102014
Backward linearised tree pattern matching
J Trávníček, J Janoušek, B Melichar, L Cleophas
International Conference on Language and Automata Theory and Applications …, 2015
82015
On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
J Trávníček, J Janoušek, B Melichar, L Cleophas
Theoretical Computer Science 830, 60-90, 2020
72020
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata
J Travníček, J Janoušek, B Melichar
Computer Science and Information Systems 9 (3), 1125-1153, 2012
62012
Efficient determinization of visibly and height-deterministic pushdown automata
R Polách, J Trávníček, J Janoušek, B Melichar
Computer Languages, Systems & Structures 46, 91-105, 2016
42016
Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
J Trávnıcek, R Oburka, T Pecka, J Janoušek
Prague Stringology Conference 2020, 61, 2020
2*2020
Indexing trees by pushdown automata for nonlinear tree pattern matching
J Trávníček, J Janoušek, B Melichar
2011 Federated Conference on Computer Science and Information Systems …, 2011
22011
Construction of a pushdown automaton accepting a postfix notation of a tree language given by a regular tree expression
T Pecka, J Trávnícek, R Polách, J Janousek
7th Symposium on Languages, Applications and Technologies (SLATE 2018), 2018
12018
A new algorithm for the determinisation of visibly pushdown automata
R Polách, J Trávníćek, J Janoušek, B Melichar
2015 federated conference on computer science and information systems …, 2015
12015
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination.
T Pecka, J Trávnícek, J Janousek
Stringology, 11-22, 2020
2020
(Nelineární) Stromové Indexování a Protisměrné Vyhledávání
J Trávníček
PQDT-Global, 2019
2019
Algoritmy pro vyhledávání nelineárních vzorků ve stromech
J Trávníček
České vysoké učení technické v Praze. Vypočetní a informační centrum., 2011
2011
Prague Stringology Conference 2020
T Pecka, J Trávníček, J Janoušek
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–13