A Note on a Tree-Based 2D Indexing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00191933" target="_blank" >RIV/68407700:21240/11:00191933 - isvavai.cz</a>
Result on the web
<a href="http://www.springerlink.com/content/5277050q21t0u676/fulltext.pdf" target="_blank" >http://www.springerlink.com/content/5277050q21t0u676/fulltext.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-18098-9_32" target="_blank" >10.1007/978-3-642-18098-9_32</a>
Alternative languages
Result language
angličtina
Original language name
A Note on a Tree-Based 2D Indexing
Original language description
A transformation of 2D structures into the form of a tree, their linearisation and constructions of pushdown automata indexing this representation of a 2D text are presented.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2011
Issue of the periodical within the volume
6482
Country of publishing house
DE - GERMANY
Number of pages
10
Pages from-to
300-309
UT code for WoS article
000290544800032
EID of the result in the Scopus database
—