Filters
Simulations and Aintichains for Efficient Handling of Tree Automata
in practice, with the main emphasis on nondeterministic tree automata. This concerns problems that arecrucial for many applications of tree automata. For size reduction of tree automata, we adapt...
IN - Informatika
- 2010 •
- B
Rok uplatnění
B - Odborná kniha
VATA: A Library for Efficient Manipulation of Non-Deterministic Tree Automata
The library contains efficient implementation of tree automata operations with the focus on testing language inclusion of a pair of automata....
IN - Informatika
- 2012 •
- R •
- Link
Rok uplatnění
R - Software
Výsledek na webu
Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)
We address the problem of computing simulation relations over tree automata. In particular, we consider downward and upward simulations on tree automata, which for an efficient size reduction of nondeterministic
JC - Počítačový hardware a software
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
This paper introduces spanning tree automata (ST automata) usable for defining sets of labeled, connected graphs. The automata are simply obtained by extending ordinary top-down finite tree automata
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Regular Tree Expressions and Deterministic Pushdown Automata
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by finite tree automata. The class of regular tree languages is a proper subclass of tree lang...
IN - Informatika
- 2011 •
- 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 of a given subject tree in prefix notation and are analogous to the suffix automataString suffix automata accept all suffixes of a g...
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
Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata
We address the problem of computing simulation relations over tree automata. In particular, we consider downward and upward simulations on tree automata, whichficient size reduction of nondeterministic
JC - Počítačový hardware a software
- 2008 •
- A
Rok uplatnění
A - Audiovizuální tvorba
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 auto...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Reduction of Nondeterministic Tree Automata
automata library, and tested its performance on a given collection of tree automata, as well as on various classes of randomly generated tree automata. Our algorithmWe present an efficient algorithm to re...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Towards Efficient Shape Analysis with Tree Automata
We discuss our proposal of a formalism for representing classes of graphs based on tree automata. We aim at a formalism and an entailment algorithm that could be used guarantees, and be general. We believe that building the formalis...
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
- 1 - 10 out of 17 723