Filters
Tree compression pushdown automaton
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed. The algorithm for constructing our push...
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
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination
a finite tree automaton to an equivalent regular tree expression. Our algorithm finite tree automaton, the transitions of which read the sets of trees described tree automaton, ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D
Rok uplatnění
D - Stať ve sborníku
Indexing Trees by Pushdown Automata for Nonlinear Tree Pattern Matching
A new kind of an acyclic pushdown automaton for an ordered tree is presented. The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and ...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
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 an input tree T and a tree pattern P, we find all subtrees in T that match P with up to k errors. We show that this problem can be solved by finite ...
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
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by a finite tree automaton as a standard model of computation. It was proved that the class of regular tree<...
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
Indexing XML Documents Using Tree Paths Automaton
called Tree Paths Automaton, is presented. Given an XML tree model T, the treeAn XML document can be viewed as a tree in a natural way. Processing tree data structures usually requires a pushdown...
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
On regular tree languages and deterministic pushdown automata
paperpresents a simple transformation from any given finite tree automaton recognizing a regular tree language to a deterministic pushdown automaton accepting the same tree tree automaton
IN - Informatika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Constrained Approximate Subtree Matching by Finite Automata
Processing tree data structures usually requires a pushdown automaton as a model of computation. Therefore, it is interesting that a finite automaton can tree with m and n nodes, respectively, the nondeterministic ...
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
On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching
We present a way of synchronizing finite tree automata: We define a synchronizing term and a k-local deterministic finite bottom–up tree automaton. Furthermore of the deterministic k-local tree automaton ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Inexact tree pattern matching with 1-degree edit distance using finite automata
version of the proposed finite automaton finds all inexact occurrences of the tree of such automaton can be exponential in the number of nodes of the tree pattern, it is practicalGiven an input tree and a...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 17 044