( en | de | ru )

 

Disambiguation

Author of the publication

copydeleteadd this publication to your clipboard
Efficient determinization of visibly and height-deterministic pushdown automata.

, , , and . Comput. Lang. Syst. Struct., (2016)

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.

Martin Janousek

Dirk Jansen

Temperaturkorrektur von mit dem Falling-Weight-Deflectometer gemessenen Deflexionen auf Asphaltbefestigungen. Uni Duisburg-Essen, (2009)

Tsai-Yu Jansen

Einfluss der Konversion laparoskopischer Operationen auf Tumorwachstum, hepatische Metastasierung und Tumorangiogenese. Uni Heidelberg, (2010)

Matthäus Janczyk

Synthese funktionalisierter Trinukleotide und ihre Anwendung bei der Randomisierung. Uni Greifswald, (2009)

Christoph Janello

Wertschöpfung im digitalisierten Buchmarkt. Uni München, (2010)
 

Other publications of authors with the same name

Clustering using artificial bee colony on CUDA., , and . SMC, page 3803-3807. IEEE, (2014)Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array., , , and . Stringology, page 61-73. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)Tree compression pushdown automaton., , and . Kybernetika, 48 (3): 429-452 (2012)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)Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination., , and . Stringology, page 11-22. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees., , , and . Theor. Comput. Sci., (2020)Efficient determinization of visibly and height-deterministic pushdown automata., , , and . Comput. Lang. Syst. Struct., (2016)Inexact tree pattern matching with 1-degree edit distance using finite automata., , and . Discret. Appl. Math., (мая 2023)Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression., , , and . SLATE, volume 62 of OASIcs, page 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)