Filters
Aho-Corasick like multiple subtree matching by deterministic pushdown automata
Aho-Corasick like multiple subtree matching by deterministic pushdown automata.
IN - Informatika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Subtree Matching by Deterministic Pushdown Automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic app...
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
String Suffix Automata and Subtree Pushdown Automata
operations results in new subtree pushdown automata, which accept all subtrees in their properties. The deterministic subtree pushdown automaton accepts an input subtree in time linear to the number of nodes of ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Subtree Matching by Pushdown Automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic app...
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees
Oracle modification of subtree pushdown automata for ranked and unranked ordered trees is presented. Subtree pushdown automata [1] represent a complete index of a tree for subtrees. Subtree oracle pushdown automata...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Constrained Approximate Subtree Matching by Finite Automata
be used to solve the constrained approximate subtree pattern matching problem to subtrees of the input tree with maximum given distance k. The distance between the pattern and subtrees of an input tree is measured...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
We compare labeled ordered trees based on unit cost 1-degree edit distance that uses operations vertex relabeling, leaf insertion, and leaf deletion. Given an input tree T and a tree pattern P, we find all subtrees in T that match P...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Matching Subtrees in Genetic Programming Crossover Operator
methods for matching subtrees to find the best possible cutting point for crossover...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D
Rok uplatnění
D - Stať ve sborníku
Matching Subtrees in Genetic Programming Crossover Operator
methods for matching subtrees to find the best possible cutting point for crossover...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Arbology: Trees and pushdown automata
of the pushdown store. Arbology results are shown for the basic problems subtree matching of ranked and unranked ordered trees it holds that subtrees of a tree in a linear......
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 7 796