( en | de | ru )

 

Disambiguation of "Melichar, Borivoj"

Author of the publication

copydeleteadd this publication to your clipboard
Tree compression pushdown automaton.

, , and . Kybernetika, 48 (3): 429-452 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Borivoj Hrazdilek

Michael Melichar

Volker Melichar

Franz Melichar

Kerstin Melichar

 

Other publications of authors with the same name

Arbology: Trees and Pushdown Automata.. LATA, volume 6031 of Lecture Notes in Computer Science, page 32-49. Springer, (2010)Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching., and . Workshop on Implementing Automata, volume 1660 of Lecture Notes in Computer Science, page 92-99. Springer, (1998)Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata., and . CIAA, volume 3317 of Lecture Notes in Computer Science, page 327-328. Springer, (2004)Directed Acyclic Subsequence Graph., and . Stringology, page 107-118. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (1998)A Note on a Tree-Based 2D Indexing., and . CIAA, volume 6482 of Lecture Notes in Computer Science, page 300-309. Springer, (2010)Attribute Evaluation and Parsing., , and . Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, page 187-214. Springer, (1991)Backward pattern matching automaton., and . Stringology, page 81-94. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2005)Tree Indexing by Pushdown Automata and Repeats of Subtrees., , , , and . FedCSIS, page 899-902. (2011)Nonlinear Tree Pattern Pushdown Automata., , and . FedCSIS, page 871-878. (2011)Tree compression pushdown automaton., , and . Kybernetika, 48 (3): 429-452 (2012)