Attributes | Values |
---|
rdf:type
| |
Description
| - This project focuses on a new research area called Arbology. This area of research is directly similar and analogous to stringology, which focuses on string problems, such as the string pattern matching problem only this time the string patterns and the subject text are replaced by tree patterns and the subject tree. The vast majority of programming languages are based on context-free grammars, and thus the generated source codes are context-free languages which can be represented by tree structures. This gives us the opportunity to effectively analyze source codes at syntax level using algorithms based on tree searching. With the use of appropriate algorithms it is possible to compare source codes, optimize source code or transform one source code to another by finding the minimal number of edit operations necessary for the transformation. The main purpose of this project is to propose algorithms for exact pattern matching in tree structures.
- This project focuses on a new research area called Arbology. This area of research is directly similar and analogous to stringology, which focuses on string problems, such as the string pattern matching problem only this time the string patterns and the subject text are replaced by tree patterns and the subject tree. The vast majority of programming languages are based on context-free grammars, and thus the generated source codes are context-free languages which can be represented by tree structures. This gives us the opportunity to effectively analyze source codes at syntax level using algorithms based on tree searching. With the use of appropriate algorithms it is possible to compare source codes, optimize source code or transform one source code to another by finding the minimal number of edit operations necessary for the transformation. The main purpose of this project is to propose algorithms for exact pattern matching in tree structures. (en)
|
Title
| - Searching in Tree Structures
- Searching in Tree Structures (en)
|
skos:prefLabel
| - Searching in Tree Structures
- Searching in Tree Structures (en)
|
skos:notation
| - RIV/68407700:21240/10:00166075!RIV11-MSM-21240___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/68407700:21240/10:00166075
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - tree; tree pattern; subtree; tree pattern matching; pushdown automata (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| |
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Flouri, Tomáš
- Melichar, Bořivoj
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - České vysoké učení technické v Praze
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |